scientific article; zbMATH DE number 176746
From MaRDI portal
Publication:4036576
Recommendations
Cited in
(21)- Dynamically switching vertices in planar graphs (extended abstract)
- Maintenance of a minimum spanning forest in a dynamic plane graph
- Dynamic and static algorithms for optimal placement of resources in a tree
- Generalized core maintenance of dynamic bipartite graphs
- A fully dynamic approximation scheme for all-pairs shortest paths in planar graphs
- Dynamic maintenance of planar digraphs, with applications
- Dynamic connectivity in digital images
- Fully dynamic biconnectivity in graphs
- Fully dynamic 2-edge-connectivity in planar graphs
- Maintaining triconnected components under node expansion
- Fully dynamic planarity testing with applications
- Maintaining the 3-Edge-Connected Components of a Graph On-Line
- Dynamic 2- and 3-connectivity on planar graphs
- Worst-case deterministic fully-dynamic biconnectivity in changeable planar embeddings
- Maintaining regular properties dynamically in k-terminal graphs
- Faster shortest-path algorithms for planar graphs
- Dynamic planar embeddings of dynamic graphs
- Dynamic planar embeddings of dynamic graphs
- Decremental 2- and 3-connectivity on planar graphs
- Contracting a planar graph efficiently
- Maintenance of triconnected components of graphs
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 Q4036576)
