Work

Dynamic Bridge-Finding in Õ (log 2 n ) Amortized Time

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
Language: English
Open Access status: bronze
OpenAlex ID: W2777026024
FWCI: 2.211
Cites: 28
Cited by: 32
Related to: 10