Fully sequential and distributed dynamic algorithms for minimum spanning trees
Pradosh Kumar Mohapatra
ACM Computing Research Repository, cs.DC/0002005
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
