Memory-Efficient Enumeration of Constrained Spanning Trees.

Jürg Nievergelt Narsingh Deo Ambros Marzetta

Published in: Inf. Process. Lett. (1999)

Keyphrases

memory efficient
spanning tree
edge disjoint
minimum spanning tree
minimum cost
minimum spanning trees
iterative deepening
external memory
search space
undirected graph
multiple sequence alignment
depth first search
root node
minimum total cost
optimization problems