Partial and Constrained Level Planarity
From MaRDI portal
Publication:4575877
Directed graphs (digraphs), tournaments (05C20) Graph theory (including graph drawing) in computer science (68R10) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Graph representations (geometric and intersection representations, etc.) (05C62)
Recommendations
- Beyond level planarity
- Multilevel planarity
- Multilevel planarity
- Some Constrained Notions of Planarity
- Practical Level Planarity Testing and Layout with Embedding Constraints
- scientific article; zbMATH DE number 6419797
- Radial level planarity with fixed embedding
- A characterization of level planar graphs
Cited in
(19)- Level planarity: transitivity vs. even crossings
- Computing k-modal embeddings of planar digraphs
- Lower levels of Euclidean planes
- Level-planar drawings with few slopes
- Experimental comparison of PC-trees and PQ-trees
- scientific article; zbMATH DE number 7559402 (Why is no real title available?)
- The importance of being proper (in clustered-level planarity and \(T\)-level planarity)
- Windrose planarity: embedding graphs with direction-constrained edges
- Multilevel planarity
- Multilevel planarity
- Beyond Clustered Planar Graphs
- scientific article; zbMATH DE number 7765366 (Why is no real title available?)
- Beyond level planarity: cyclic, torus, and simultaneous level planarity
- Level-planar drawings with few slopes
- Inserting one edge into a simple drawing is hard
- An SPQR-tree-like embedding representation for upward planarity
- Extending simple drawings
- Level-planarity: transitivity vs. even crossings
- Constrained planarity in practice: engineering the synchronized planarity algorithm
This page was built for publication: Partial and Constrained Level Planarity
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4575877)
