Author： Bauernoppel F. Kranakis E. Krizanc D. Maheshwari A. Sack J.-R. Urrutia J.
Publisher： Elsevier
ISSN： 0304-3975
Source： Theoretical Computer Science, Vol.175, Iss.2, 1997-04, pp. : 239-255
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
Disk Embeddings of Planar Graphs
Algorithmica, Vol. 38, Iss. 4, 2004-01 ,pp. :
Access to resources
Recommend
The monadic second-order logic of graphs XII: planar graphs and planar maps
By Courcelle B.
Theoretical Computer Science, Vol. 237, Iss. 1, 2000-04 ,pp. :
A simple recognition of maximal planar graphs
By Nagamochi H. Suzuki T. Ishii T.
Information Processing Letters, Vol. 89, Iss. 5, 2004-03 ,pp. :
Towards area requirements for drawing hierarchically planar graphs
Theoretical Computer Science, Vol. 292, Iss. 3, 2003-01 ,pp. :
Maximum Flow in Directed Planar Graphs with Vertex Capacities
Algorithmica, Vol. 61, Iss. 1, 2011-09 ,pp. :