Maintaining regular properties dynamically in $k$-terminal graphs
Greg N. Frederickson
Algorithmica
22(3):330–350, Nov 1998
Cites:
Maintenance of a minimum spanning forest in a dynamic planar graph
Separator based sparsification I: planarity testing and minimum spanning trees
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
