On the computational complexity of upward and rectilinear planarity testing
- 1 January 1995
- book chapter
- Published by Springer Nature
Abstract
No abstract availableKeywords
This publication has 18 references indexed in Scilit:
- Upward drawings of triconnected digraphsAlgorithmica, 1994
- Spirality of orthogonal representations and optimal drawings of series-parallel graphs and 3-planar graphs (extended abstract)Published by Springer Nature ,1993
- Reading, Drawing, and OrderPublished by Springer Nature ,1993
- Drawing planar graphs using the lmc-orderingPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1992
- General theoretical results on rectilinear embedability of graphsActa Mathematicae Applicatae Sinica, English Series, 1991
- Bipartite graphs, upward drawings, and planarityInformation Processing Letters, 1990
- Algorithms for plane representations of acyclic digraphsTheoretical Computer Science, 1988
- Fundamentals of planar ordered setsDiscrete Mathematics, 1987
- Planar lattices and planar graphsJournal of Combinatorial Theory, Series B, 1976
- Planar LatticesCanadian Journal of Mathematics, 1975