Year: 2018
Type: conference-paper
Abstract: We present a deterministic fully-dynamic data structure for maintaining information about the bridges in a graph. We support updates in Õ((log n)2) amortized time, and can find a bridge in the component of any given vertex, or a bridge separating any two given vertices, in
Authors: Jacob Holm, Eva Rotenberg, Mikkel Thorup
Institutions: University of Copenhagen, Technical University of Denmark
Language: English
Subfield: Computational Theory and Mathematics
Field: Computer Science
Domain: Physical Sciences
Open Access status: bronze
Funder: Danmarks Frie Forskningsfond
Award: G3405030368
OpenAlex ID: W2777026024
