Maintaining the 4-edge-connected components of a graph on-line
Yefim A. Dinitz
Proc. 2nd Israel Symp. Theory of Computing & Systems
,
1993, pp. 88–99
Cites:
Sparsification — A technique for speeding up dynamic graph algorithms
[
D. Eppstein publications
] [
Citation database
] [
Documents
]
Fano
Experimental Web Server,
D. Eppstein
,
School of Information & Computer Science
,
UC Irvine
