Dynamically switching vertices in planar graphs

DOI10.1007/s004530010032zbMath0959.68099OpenAlexW2157901347MaRDI QIDQ1578392

Daniele Frigioni, Giuseppe F. Italiano

Publication date: 26 April 2001

Published in: Algorithmica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s004530010032

zbMATH Keywords

planar graphsdynamic algorithms

Mathematics Subject Classification ID

Nonnumerical algorithms (68W05) Graph theory (including graph drawing) in computer science (68R10)

Related Items (11)

Matching Triangles and Basing Hardness on an Extremely Popular Conjecture ⋮ 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 ⋮ 3D geo-graphs: efficient flip verification for the spherical zoning problem ⋮ Hybrid port--Hamiltonian systems: from parameterized incidence matrices to hybrid automata ⋮ Unnamed Item ⋮ Efficient geo-graph contiguity and hole algorithms for geographic zoning and dynamic plane graph partitioning ⋮ Connectivity Oracles for Graphs Subject to Vertex Failures ⋮ Space-efficient fully dynamic DFS in undirected graphs ⋮ Dynamic DFS in Undirected Graphs: Breaking the $O(m)$ Barrier

This page was built for publication: Dynamically switching vertices in planar graphs