A Parameterized Algorithm for Upward Planarity Testing
Author:
- 1 January 2004
- book chapter
- Published by Springer Nature
- p. 157-168
Abstract
No abstract availableKeywords
This publication has 21 references indexed in Scilit:
- A Parameterized Algorithm for Upward Planarity Testing2004
- Quasi-Upward PlanarityAlgorithmica, 2002
- A Fixed-Parameter Approach to Two-Layer PlanarizationLecture Notes in Computer Science, 2002
- Optimal Upward Planarity Testing of Single-Source DigraphsSIAM Journal on Computing, 1998
- Upward Planarity Checking: “Faces Are More than Polygons”Lecture Notes in Computer Science, 1998
- Upward drawings of triconnected digraphsAlgorithmica, 1994
- Area requirement and symmetry display of planar upward drawingsDiscrete & Computational Geometry, 1992
- Bipartite graphs, upward drawings, and planarityInformation Processing Letters, 1990
- Algorithms for plane representations of acyclic digraphsTheoretical Computer Science, 1988
- Graph Theory with Applications1976