Dynamically switching vertices in planar graphs
From MaRDI portal
Recommendations
Cited in
(16)- Amortized efficiency of a path retrieval data structure
- Fault tolerant depth first search in undirected graphs: simple yet efficient
- Mincut sensitivity data structures for the insertion of an edge
- Space-efficient fully dynamic DFS in undirected graphs
- Hybrid port--Hamiltonian systems: from parameterized incidence matrices to hybrid automata
- Efficient geo-graph contiguity and hole algorithms for geographic zoning and dynamic plane graph partitioning
- Connectivity oracles for graphs subject to vertex failures
- Matching Triangles and Basing Hardness on an Extremely Popular Conjecture
- Fault tolerant and fully dynamic DFS in undirected graphs: simple yet efficient
- Dynamic DFS in undirected graphs: breaking the \(O(m)\) barrier
- 3D geo-graphs: efficient flip verification for the spherical zoning problem
- Dynamic geometric connectivity in the plane with constant query time
- On the complexity of algorithms with predictions for dynamic graph problems
- Connectivity oracles for predictable vertex failures
- An optimal 3-fault-tolerant connectivity oracle
- Dynamically switching vertices in planar graphs (extended abstract)
This page was built for publication: Dynamically switching vertices in planar graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1578392)
