Maintaining spanning trees of small diameter
Giuseppe F. Italiano
and
R. Ramaswami
Algorithmica
22(3):285–304, Nov 1998
Cites:
Sparsification — A technique for speeding up dynamic 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
