Author： Damiand G. Habib M. Paul C.
Publisher： Elsevier
ISSN： 0304-3975
Source： Theoretical Computer Science, Vol.263, Iss.1, 2001-07, pp. : 99-111
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
A necessary condition for a graph to be the visibility graph of a simple polygon
By Chen C.
Theoretical Computer Science, Vol. 276, Iss. 1, 2002-04 ,pp. :
A Fully Dynamic Graph Algorithm for Recognizing Interval Graphs
By Ibarra Louis
Algorithmica, Vol. 58, Iss. 3, 2010-11 ,pp. :