Author： Zhi-Zhong C.
Publisher： Elsevier
ISSN： 0304-3975
Source： Theoretical Computer Science, Vol.143, Iss.2, 1995-06, pp. : 309-318
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
Disk Embeddings of Planar Graphs
Algorithmica, Vol. 38, Iss. 4, 2004-01 ,pp. :
Small maximal matchings in random graphs
By Zito M.
Theoretical Computer Science, Vol. 297, Iss. 1, 2003-03 ,pp. :
Fast RNC and NC algorithms for maximal path sets
Theoretical Computer Science, Vol. 215, Iss. 1, 1999-02 ,pp. :