Graph graphics: Theory and practice
- 1 January 1988
- journal article
- Published by Elsevier in Computers & Mathematics with Applications
- Vol. 15 (4), 247-253
- https://doi.org/10.1016/0898-1221(88)90208-8
Abstract
No abstract availableKeywords
This publication has 7 references indexed in Scilit:
- NP-completeness for minimizing maximum edge length in grid embeddingsJournal of Algorithms, 1985
- A linear algorithm for embedding planar graphs using PQ-treesJournal of Computer and System Sciences, 1985
- A framework for solving VLSI graph layout problemsJournal of Computer and System Sciences, 1984
- Crossing Number is NP-CompleteSIAM Journal on Algebraic Discrete Methods, 1983
- Testing for the consecutive ones property, interval graphs, and graph planarity using PQ-tree algorithmsJournal of Computer and System Sciences, 1976
- Computing an st-numberingTheoretical Computer Science, 1976
- Efficient Planarity TestingJournal of the ACM, 1974