Planar grid embedding in linear time
- 1 January 1989
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Circuits and Systems
- Vol. 36 (9) , 1230-1234
- https://doi.org/10.1109/31.34669
Abstract
No abstract availableKeywords
This publication has 11 references indexed in Scilit:
- Algorithms for plane representations of acyclic digraphsTheoretical Computer Science, 1988
- Automatic graph drawing and readability of diagramsIEEE Transactions on Systems, Man, and Cybernetics, 1988
- On Embedding a Graph in the Grid with the Minimum Number of BendsSIAM Journal on Computing, 1987
- Rectilinear planar layouts and bipolar orientations of planar graphsDiscrete & Computational Geometry, 1986
- A unified approach to visibility representations of planar graphsDiscrete & Computational Geometry, 1986
- A layout algorithm for data flow diagramsIEEE Transactions on Software Engineering, 1986
- Rectilinear Graphs and Their EmbeddingsSIAM Journal on Computing, 1985
- On minimal‐node‐cost planar embeddingsNetworks, 1984
- Universality considerations in VLSI circuitsIEEE Transactions on Computers, 1981
- Graph Theory with ApplicationsPublished by Springer Nature ,1976