Dynamically switching vertices in planar graphs

DOI10.1007/S004530010032MaRDI QIDQ1578392zbMATH OpenOpenAlexFDO

Authors 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

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

Recommendations

• Dynamically switching vertices in planar graphs (extended abstract)
• scientific article; zbMATH DE number 176746
• Dynamic 2- and 3-connectivity on planar graphs
• scientific article; zbMATH DE number 1256640

Cited in

(12)

• Dynamically switching vertices in planar graphs (extended abstract)
• scientific article; zbMATH DE number 7561709 (Why is no real title available?)
• Dynamic DFS in undirected graphs: breaking the \(O(m)\) barrier
• Matching Triangles and Basing Hardness on an Extremely Popular Conjecture
• Fault tolerant depth first search in undirected graphs: simple yet efficient
• Space-efficient fully dynamic DFS in undirected graphs
• Hybrid port--Hamiltonian systems: from parameterized incidence matrices to hybrid automata
• Mincut sensitivity data structures for the insertion of an edge
• Amortized efficiency of a path retrieval data structure
• 3D geo-graphs: efficient flip verification for the spherical zoning problem
• Connectivity oracles for graphs subject to vertex failures
• Efficient geo-graph contiguity and hole algorithms for geographic zoning and dynamic plane graph partitioning

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)