Upward drawings of triconnected digraphs
- 1 December 1994
- journal article
- Published by Springer Nature in Algorithmica
- Vol. 12 (6) , 476-497
- https://doi.org/10.1007/bf01188716
Abstract
No abstract availableThis publication has 23 references indexed in Scilit:
- How to draw a directed graphPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2003
- Area requirement and symmetry display of planar upward drawingsDiscrete & Computational Geometry, 1992
- Bipartite graphs, upward drawings, and planarityInformation Processing Letters, 1990
- Graphical Data Structures for Ordered SetsPublished by Springer Nature ,1989
- Incremental planarity testingPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1989
- Algorithms for plane representations of acyclic digraphsTheoretical Computer Science, 1988
- Fundamentals of planar ordered setsDiscrete Mathematics, 1987
- A linear algorithm for embedding planar graphs using PQ-treesJournal of Computer and System Sciences, 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