Author： Koch I.
Publisher： Elsevier
ISSN： 0304-3975
Source： Theoretical Computer Science, Vol.250, Iss.1, 2001-01, pp. : 1-30
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
A simple recognition of maximal planar graphs
By Nagamochi H. Suzuki T. Ishii T.
Information Processing Letters, Vol. 89, Iss. 5, 2004-03 ,pp. :
Access to resources
Recommend
Small maximal matchings in random graphs
By Zito M.
Theoretical Computer Science, Vol. 297, Iss. 1, 2003-03 ,pp. :
Scheduling loosely connected task graphs
By Ranade A.G.
Journal of Computer and System Sciences, Vol. 67, Iss. 1, 2003-08 ,pp. :