Dynamic maintenance of planar digraphs, with applications
From MaRDI portal
Recommendations
- scientific article; zbMATH DE number 176746
- Maintenance of a minimum spanning forest in a dynamic plane graph
- Dynamic maintenance of directed hypergraphs
- Dynamically switching vertices in planar graphs (extended abstract)
- Dynamic 2- and 3-connectivity on planar graphs
- Maintaining chordal graphs dynamically: improved upper and lower bounds
- Fast algorithms for maintaining shortest paths in outerplanar and planar digraphs
- Generalized core maintenance of dynamic bipartite graphs
- Dynamic planar embeddings of dynamic graphs
- Dynamic planar embeddings of dynamic graphs
Cites work
- scientific article; zbMATH DE number 3936534 (Why is no real title available?)
- scientific article; zbMATH DE number 4060744 (Why is no real title available?)
- scientific article; zbMATH DE number 4083002 (Why is no real title available?)
- scientific article; zbMATH DE number 3688740 (Why is no real title available?)
- scientific article; zbMATH DE number 3716814 (Why is no real title available?)
- scientific article; zbMATH DE number 43279 (Why is no real title available?)
- scientific article; zbMATH DE number 3204690 (Why is no real title available?)
- scientific article; zbMATH DE number 3315017 (Why is no real title available?)
- A linear algorithm for embedding planar graphs using PQ-trees
- A linear algorithm to find a rectangular dual of a planar triangulated graph
- A unified approach to visibility representations of planar graphs
- Algorithms for plane representations of acyclic digraphs
- Amortized efficiency of a path retrieval data structure
- Data Structures for On-Line Updating of Minimum Spanning Trees, with Applications
- Finding paths and deleting edges in directed acyclic graphs
- Floorplans, planar graphs, and layouts
- Fully Dynamic Point Location in a Monotone Subdivision
- Fundamentals of planar ordered sets
- Location of a Point in a Planar Subdivision and Its Applications
- On the vector representation of the reachability in planar directed graphs
- Optimal Point Location in a Monotone Subdivision
- Planar Lattices
- Planar embedding: linear-time algorithms for vertex placement and edge orderings
- Rectilinear planar layouts and bipolar orientations of planar graphs
- Representing orders on the plane by translating convex figures
Cited in
(14)- Dynamic reachability in planar digraphs with one source and one sink
- Generalized core maintenance of dynamic bipartite graphs
- Optimizing planned maintenance graphs for collections of engineering network sections
- Optimal MST Maintenance for Transient Deletion of Every Node in Planar Graphs
- An efficient parallel algorithm for shortest paths in planar layered digraphs
- An efficient parallel algorithm for shortest paths in planar layered digraphs
- Area requirement and symmetry display of planar upward drawings
- Maintaining regular properties dynamically in k-terminal graphs
- Lower bounds for dynamic transitive closure, planar point location, and parentheses matching
- Dynamic expression trees
- Crossing-Optimal Acyclic Hamiltonian Path Completion and Its Application to Upward Topological Book Embeddings
- Fully Dynamic Transitive Closure in plane dags with one source and one sink
- I/O-efficient dynamic planar point location
- Maintenance of triconnected components of graphs
This page was built for publication: Dynamic maintenance of planar digraphs, with applications
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q911751)
