Pages that link to "Item:Q1578392"
From MaRDI portal
The following pages link to Dynamically switching vertices in planar graphs (Q1578392):
Displayed 11 items.
- Amortized efficiency of a path retrieval data structure (Q1099629) (← links)
- Fault tolerant depth first search in undirected graphs: simple yet efficient (Q2149103) (← links)
- Mincut sensitivity data structures for the insertion of an edge (Q2165037) (← links)
- Space-efficient fully dynamic DFS in undirected graphs (Q2312405) (← links)
- Hybrid port--Hamiltonian systems: from parameterized incidence matrices to hybrid automata (Q2496810) (← links)
- Efficient geo-graph contiguity and hole algorithms for geographic zoning and dynamic plane graph partitioning (Q2515049) (← links)
- Connectivity Oracles for Graphs Subject to Vertex Failures (Q3387763) (← links)
- Matching Triangles and Basing Hardness on an Extremely Popular Conjecture (Q4571929) (← links)
- (Q5092428) (← links)
- Dynamic DFS in Undirected Graphs: Breaking the $O(m)$ Barrier (Q5232328) (← links)
- 3D geo-graphs: efficient flip verification for the spherical zoning problem (Q6110624) (← links)