scientific article; zbMATH DE number 432821
From MaRDI portal
Publication:3138955
Directed graphs (digraphs), tournaments (05C20) Graph algorithms (graph-theoretic aspects) (05C85) Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Planar graphs; geometric and topological aspects of graph theory (05C10) Structural characterization of families of graphs (05C75)
Recommendations
- scientific article; zbMATH DE number 431511
- Upward Planar Drawing of Single-Source Acyclic Digraphs
- scientific article; zbMATH DE number 4062623
- 1-bend upward planar drawings of SP-digraphs
- Path-monotonic upward drawings of graphs
- Bipartite graphs, upward drawings, and planarity
- Computing maximum upward planar subgraphs of single-source embedded digraphs
- Maximum upward planar subgraph of a single-source embedded digraph
Cited in
(22)- Upward Planar Drawings and Switch-regularity Heuristics
- Bipartite graphs, upward drawings, and planarity
- scientific article; zbMATH DE number 431511 (Why is no real title available?)
- Computing maximum upward planar subgraphs of single-source embedded digraphs
- On upward-planar L-drawings of graphs
- Upward Embeddings and Orientations of Undirected Planar Graphs
- Testing upward planarity of partial 2-trees
- Upward planarity testing
- scientific article; zbMATH DE number 4062623 (Why is no real title available?)
- Quasi-upward planarity
- Every triangle-free planar graph has a planar upward drawing
- Acyclic orientation of drawings
- Area requirement and symmetry display of planar upward drawings
- Upward Planar Drawing of Single-Source Acyclic Digraphs
- Parameterized algorithms for upward planarity
- A note on optimal area algorithms for upward drawings of binary trees
- On the page number of upward planar directed acyclic graphs
- On the page number of upward planar directed acyclic graphs
- Upward drawings of triconnected digraphs.
- Multiple alignment of biological sequences with gap flexibility
- Upward planarity testing in practice: SAT formulations and comparative study
- Maximum upward planar subgraph of a single-source embedded digraph
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3138955)