A linear-time algorithm for drawing a planar graph on a grid
- 1 May 1995
- journal article
- Published by Elsevier in Information Processing Letters
- Vol. 54 (4) , 241-246
- https://doi.org/10.1016/0020-0190(95)00020-d
Abstract
No abstract availableKeywords
This publication has 6 references indexed in Scilit:
- How to draw a planar graph on a gridCombinatorica, 1990
- Rectilinear planar layouts and bipolar orientations of planar graphsDiscrete & Computational Geometry, 1986
- A unified approach to visibility representations of planar graphsDiscrete & Computational Geometry, 1986
- Drawing plane graphs nicelyActa Informatica, 1985
- Testing for the consecutive ones property, interval graphs, and graph planarity using PQ-tree algorithmsJournal of Computer and System Sciences, 1976
- Efficient Planarity TestingJournal of the ACM, 1974