Dynamic embeddings of dynamic single-source upward planar graphs
From MaRDI portal
Cites work
- scientific article; zbMATH DE number 177843 (Why is no real title available?)
- scientific article; zbMATH DE number 2079390 (Why is no real title available?)
- A sublinear bound on the page number of upward planar graphs
- Algorithms for plane representations of acyclic digraphs
- Alpha-algorithms for incremental planarity testing (extended abstract)
- An SPQR-tree-like embedding representation for upward planarity
- Certificates and fast algorithms for biconnectivity in fully-dynamic graphs
- Dynamic planar embeddings of dynamic graphs
- Efficient Planarity Testing
- Encyclopedia of Algorithms
- Extending upward planar graph drawings
- Fast incremental planarity testing
- Fully-dynamic planarity testing in polylogarithmic time
- Fundamentals of planar ordered sets
- Lower bounds for dynamic connectivity
- On the computational complexity of upward and rectilinear planarity testing
- On-Line Planarity Testing
- Optimal Upward Planarity Testing of Single-Source Digraphs
- Parameterized algorithms for upward planarity
- Planar lattices and planar graphs
- Separator based sparsification. I: Planarity testing and minimum spanning trees
- Testing Planarity of Partially Embedded Graphs
- Upward Planar Drawing of Single-Source Acyclic Digraphs
- Upward drawings of triconnected digraphs.
- Upward planar morphs
- Upward spirality and upward planarity testing
- Worst-Case Polylog Incremental SPQR-trees: Embeddings, Planarity, and Triconnectivity
This page was built for publication: Dynamic embeddings of dynamic single-source upward planar graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7253135)
