Pages that link to "Item:Q911751"
From MaRDI portal
The following pages link to Dynamic maintenance of planar digraphs, with applications (Q911751):
Displaying 14 items.
- Optimizing planned maintenance graphs for collections of engineering network sections (Q544682) (← links)
- Dynamic reachability in planar digraphs with one source and one sink (Q688163) (← links)
- Generalized core maintenance of dynamic bipartite graphs (Q832654) (← links)
- Area requirement and symmetry display of planar upward drawings (Q1189288) (← links)
- Maintaining regular properties dynamically in \(k\)-terminal graphs (Q1273938) (← links)
- Dynamic expression trees (Q1346771) (← links)
- I/O-efficient dynamic planar point location (Q1882856) (← links)
- An efficient parallel algorithm for shortest paths in planar layered digraphs (Q1899220) (← links)
- Optimal MST Maintenance for Transient Deletion of Every Node in Planar Graphs (Q3082947) (← links)
- Crossing-Optimal Acyclic Hamiltonian Path Completion and Its Application to Upward Topological Book Embeddings (Q3605502) (← links)
- Lower bounds for dynamic transitive closure, planar point location, and parentheses matching (Q5054813) (← links)
- Maintenance of triconnected components of graphs (Q5204330) (← links)
- An efficient parallel algorithm for shortest paths in planar layered digraphs (Q5490027) (← links)
- Fully Dynamic Transitive Closure in plane dags with one source and one sink (Q6102301) (← links)