Upward Planar Drawings and Switch-regularity Heuristics
From MaRDI portal
Publication:5301392
Recommendations
- SOFSEM 2005: Theory and Practice of Computer Science
- Quasi-upward planar drawings of mixed graphs with few bends: heuristics and exact methods
- Bipartite graphs, upward drawings, and planarity
- Quasi-upward planar drawings with minimum curve complexity
- Upward Planar Drawing of Single-Source Acyclic Digraphs
- scientific article; zbMATH DE number 431511
- scientific article; zbMATH DE number 432821
- Upward planar graphs and their duals
- SOFSEM 2005: Theory and Practice of Computer Science
- Strictly convex drawings of planar graphs
Cited in
(13)- 1-bend upward planar slope number of SP-digraphs
- Computing upward topological book embeddings of upward planar digraphs
- Computing maximum upward planar subgraphs of single-source embedded digraphs
- Upward and quasi-upward planarity testing of embedded mixed graphs
- Switch-regular upward planarity testing of directed trees
- 1-bend upward planar drawings of SP-digraphs
- Upward planarity testing of embedded mixed graphs
- Switch-regular upward planar embeddings of trees
- On Turn-Regular Orthogonal Representations
- On turn-regular orthogonal representations
- Computing Upward Topological Book Embeddings of Upward Planar Digraphs
- SOFSEM 2005: Theory and Practice of Computer Science
- Maximum upward planar subgraphs of embedded planar digraphs
This page was built for publication: Upward Planar Drawings and Switch-regularity Heuristics
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5301392)