A linear algorithm for analysis of minimum spanning and shortest-path trees of planar graphs
Heather Booth
and
Jeffery R. Westbrook
Algorithmica
11:341–352, 1994
Cites:
Finding the $k$ smallest spanning trees
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
