A flexible algorithm for generating all the spanning trees in undirected graphs
Tomomi Matsui
Algorithmica
18(4):530–543, Aug 1997
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