A simple recognition of maximal planar graphs

Author： Nagamochi H.   Suzuki T.   Ishii T.  

Publisher： Elsevier

ISSN： 0020-0190

Source： Information Processing Letters, Vol.89, Iss.5, 2004-03, pp. : 223-226

Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.

Previous Menu Next

Related content

The maximal f-dependent set problem for planar graphs is in NC

By Zhi-Zhong C.  

Theoretical Computer Science, Vol. 143, Iss. 2, 1995-06 ,pp. : 309-318

Elsevier

Access to resources Recommend Favorite

An Optimal Simple Parallel Algorithm for Testing Isomorphism of Maximal Outerplanar Graphs

By Ku S-C.   Wang B-F.  

Journal of Parallel and Distributed Computing, Vol. 62, Iss. 2, 2002-02 ,pp. : 221-227

Academic Press

Access to resources Recommend Favorite

A simple paradigm for graph recognition: application to cographs and distance hereditary graphs

By Damiand G.   Habib M.   Paul C.  

Theoretical Computer Science, Vol. 263, Iss. 1, 2001-07 ,pp. : 99-111

Elsevier

Access to resources Recommend Favorite

A Simple O(log N) Time Parallel Algorithm for Testing Isomorphism of Maximal Outerplanar Graphs

By Gupta S.S.   Sinha B.P.  

Journal of Parallel and Distributed Computing, Vol. 56, Iss. 2, 1999-02 ,pp. : 144-155

Academic Press

Access to resources Recommend Favorite

Disk Embeddings of Planar Graphs

By Chen Zhi-Zhong   He Xin  

Algorithmica, Vol. 38, Iss. 4, 2004-01 ,pp. : 539-576

Springer Publishing Company

Access to resources Recommend Favorite