Author： Sakuma T.
Publisher： Elsevier
ISSN： 0304-3975
Source： Theoretical Computer Science, Vol.235, Iss.2, 2000-03, pp. : 309-324
Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.
Abstract
Related content
Efficient Union-Find for planar graphs and other sparse graph classes
By Gustedt J.
Theoretical Computer Science, Vol. 203, Iss. 1, 1998-08 ,pp. :
Access to resources
Recommend
Perfect (0,+/-1)-matrices and perfect bidirected graphs
By Tamura A.
Theoretical Computer Science, Vol. 235, Iss. 2, 2000-03 ,pp. :
A note on maximum independent sets in rectangle intersection graphs
By Chan T.M.
Information Processing Letters, Vol. 89, Iss. 1, 2004-01 ,pp. :
A new PAC bound for intersection-closed concept classes
By Auer Peter
Machine Learning, Vol. 66, Iss. 2-3, 2007-03 ,pp. :
Learning Nested Differences of Intersection-Closed Concept Classes
By Helmbold D.
Machine Learning, Vol. 05, Iss. 2, 1990-06 ,pp. :