Near-optimal fully-dynamic graph connectivity
Mikkel Thorup
Proc. 32nd Symp. Theory of Computing
,
ACM
,
May 2000, pp. 343–350
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
