Planar graphs; geometric and topological aspects of graph theory (05C10) Graph algorithms (graph-theoretic aspects) (05C85) Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Nonnumerical algorithms (68W05)
Recommendations
- scientific article; zbMATH DE number 1377359
- Planar embedding: linear-time algorithms for vertex placement and edge orderings
- Radial Level Planarity Testing and Embedding in Linear Time
- Embedding into the rectilinear plane in optimal \(O(n^{2})\) time
- Graph Drawing
- Projective Planarity in Linear Time
- Linear Time Planarity Testing and Embedding of Strongly Connected Cyclic Level Graphs
- Embedding rectilinear graphs in linear time
Cited in
(31)- Level-planarity: transitivity vs. even crossings
- Computing upward topological book embeddings of upward planar digraphs
- Beyond level planarity: cyclic, torus, and simultaneous level planarity
- A satisfiability formulation of problems on level graphs
- Strip planarity testing
- Hanani-Tutte for Radial Planarity II
- Beyond level planarity
- Straight-Line Drawability of a Planar Graph Plus an Edge
- Linear Time Planarity Testing and Embedding of Strongly Connected Cyclic Level Graphs
- Embeddability Problems for Upward Planar Digraphs
- scientific article; zbMATH DE number 4049078 (Why is no real title available?)
- Upward planar drawings on the standing and the rolling cylinders
- scientific article; zbMATH DE number 1990778 (Why is no real title available?)
- scientific article; zbMATH DE number 2080102 (Why is no real title available?)
- Data Structures and their Planar Graph Layouts
- scientific article; zbMATH DE number 1377359 (Why is no real title available?)
- Radial level planarity with fixed embedding
- Multilevel planarity
- Strip planarity testing for embedded planar graphs
- Characterization of Unlabeled Level Planar Graphs
- Cyclic Level Planarity Testing and Embedding
- Practical Level Planarity Testing and Layout with Embedding Constraints
- Constrained Simultaneous and Near-Simultaneous Embeddings
- Multilevel planarity
- Algorithms for multi-level graph planarity testing and layout
- scientific article; zbMATH DE number 7765366 (Why is no real title available?)
- Level planarity is more difficult than we thought (poster abstract)
- Partial and constrained level planarity
- Characterization of unlabeled level planar trees
- Simultaneous graph embedding with bends and circular arcs
- Matched drawability of graph pairs and of graph triples
This page was built for publication: Level Planar Embedding in Linear Time
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4540530)
