Spanning trees of countable graphs omitting sets of dominated ends.

François Laviolette Norbert Polat

Published in: Discret. Math. (1999)

Keyphrases

spanning tree
minimum spanning tree
minimum spanning trees
edge disjoint
minimum cost
undirected graph
minimum weight
weighted graph
markov chain
edge weights
shortest path
minimum total cost
markov decision processes
graph matching
depth first search
root node