Upward planarity testing
From MaRDI portal
Publication:1904391
DOI10.1007/BF01108622zbMATH Open0836.68081WikidataQ55966842 ScholiaQ55966842MaRDI QIDQ1904391FDOQ1904391
Publication date: 11 April 1996
Published in: Order (Search for Journal in Brave)
Graph theory (including graph drawing) in computer science (68R10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Planar graphs; geometric and topological aspects of graph theory (05C10) Parallel algorithms in computer science (68W10) Ordered sets (06A99)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Testing for the consecutive ones property, interval graphs, and graph planarity using PQ-tree algorithms
- Efficient Planarity Testing
- Partial orders of dimension 2
- Area requirement and symmetry display of planar upward drawings
- Algorithms for drawing graphs: An annotated bibliography
- Dividing a Graph into Triconnected Components
- On the computational complexity of upward and rectilinear planarity testing
- Planar Lattices
- Bipartite graphs, upward drawings, and planarity
- Algorithms for plane representations of acyclic digraphs
- Fundamentals of planar ordered sets
- Optimal Upward Planarity Testing of Single-Source Digraphs
- Upward drawings of triconnected digraphs.
- Planar lattices and planar graphs
- HOW TO DRAW A SERIES-PARALLEL DIGRAPH
- A Depth-First-Search Characterization of Planarity
- Planar acyclic oriented graphs
Cited In (17)
- Upward Planarity Testing: A Computational Study
- Upward planar morphs
- Upward Planarity Testing of Embedded Mixed Graphs
- The complexity of upward drawings on spheres
- Monotone drawings of graphs with fixed embedding
- Monotone Drawings of Graphs with Fixed Embedding
- Title not available (Why is that?)
- Maximum upward planar subgraphs of embedded planar digraphs
- Advances in the theory and practice of graph drawing
- Drawing directed acyclic graphs: an experimental study
- Upward planar graphs and their duals
- TWO FIXED-PARAMETER TRACTABLE ALGORITHMS FOR TESTING UPWARD PLANARITY
- Parameterized complexity of graph planarity with restricted cyclic orders
- Parameterized complexity of graph planarity with restricted cyclic orders
- The partial visibility representation extension problem
- Combinatorial characterization of upward planarity
- A graphical calculus for semi-groupal categories
This page was built for publication: Upward planarity testing
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1904391)
