Maintenance of 2- and 3-edge-connected components of graphs II
Johannes A. La Poutré
SIAM J. Computing
29(5):1521–1549, Mar 2000
Cites:
Sparsification — A technique for speeding up dynamic graph algorithms
Separator based sparsification for dynamic planar graph algorithms
Maintenance of a minimum spanning forest in a dynamic planar graph
[
D. Eppstein publications
] [
Citation database
] [
Documents
]
Fano
Experimental Web Server,
D. Eppstein
,
School of Information & Computer Science
,
UC Irvine
