Computing k-modal embeddings of planar digraphs
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 4094812 (Why is no real title available?)
- scientific article; zbMATH DE number 177843 (Why is no real title available?)
- Algorithms and bounds for L-drawings of directed graphs
- Beyond level planarity
- Efficient Planarity Testing
- Hierarchies and planarity theory
- Intersection-link representations of graphs
- Maximum upward planar subgraphs of embedded planar digraphs
- On the computational complexity of upward and rectilinear planarity testing
- Partial and Constrained Level Planarity
- Planar L-drawings of directed graphs
- Radial Level Planarity Testing and Embedding in Linear Time
- Testing for the consecutive ones property, interval graphs, and graph planarity using PQ-tree algorithms
- The importance of being proper
- Theory and Applications of Satisfiability Testing
- Turning cliques into paths to achieve planarity
- Upward and quasi-upward planarity testing of embedded mixed graphs
- Upward drawings of triconnected digraphs.
- Windrose planarity: embedding graphs with direction-constrained edges
Cited in
(6)
This page was built for publication: Computing k-modal embeddings of planar digraphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5075755)
