Lower bounds for fully dynamic connectivity problems in graphs
Monika Rauch Henzinger
and
Michael L. Fredman
Algorithmica
22(3):351–362, Nov 1998
Cites:
Dynamic connectivity in digital images
Maintenance of a minimum spanning forest in a dynamic planar graph
Sparsification — A technique for speeding up dynamic graph algorithms
Separator based sparsification for dynamic planar graph algorithms
[
D. Eppstein publications
] [
Citation database
] [
Documents
]
Fano
Experimental Web Server,
D. Eppstein
,
School of Information & Computer Science
,
UC Irvine
