Regular edge labeling of 4-connected plane graphs and its applications in graph drawing problems
- 10 February 1997
- journal article
- Published by Elsevier in Theoretical Computer Science
- Vol. 172 (1-2) , 175-193
- https://doi.org/10.1016/s0304-3975(95)00257-x
Abstract
No abstract availableKeywords
This publication has 17 references indexed in Scilit:
- Grid embedding of 4-connected plane graphsPublished by Springer Nature ,1996
- An efficient parallel algorithm for finding rectangular duals of plane triangular graphsAlgorithmica, 1995
- Algorithms for drawing graphs: an annotated bibliographyComputational Geometry, 1994
- On Finding the Rectangular Duals of Planar Triangular GraphsSIAM Journal on Computing, 1993
- A theory of rectangular dual graphsAlgorithmica, 1990
- A linear algorithm to find a rectangular dual of a planar triangulated graphAlgorithmica, 1988
- A linear time algorithm to check for the existence of a rectangular dual of a planar triangulated graphNetworks, 1987
- Rectangular duals of planar graphsNetworks, 1985
- Arboricity and Subgraph Listing AlgorithmsSIAM Journal on Computing, 1985
- Efficient Planarity TestingJournal of the ACM, 1974