Worst-case deterministic fully-dynamic biconnectivity in changeable planar embeddings

DOI10.20382/JOCG.V15.I2.A7MaRDI QIDQ6994353zbMATH OpenFDO

Authors Jacob Holm, Ivor van der Hoog, Eva Rotenberg

Publication date 23 April 2025

Published in Journal of Computational Geometry (Search for Journal in Brave)

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Graph theory (including graph drawing) in computer science (68R10) Analysis of algorithms (68W40) Data structures (68P05) Planar graphs; geometric and topological aspects of graph theory (05C10) Connectivity (05C40)

This page was built for publication: Worst-case deterministic fully-dynamic biconnectivity in changeable planar embeddings

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6994353)