Login / Signup
Spanning trees with a bounded number of leaves in a claw-free graph.
Mikio Kano
Aung Kyaw
Haruhide Matsuda
Kenta Ozeki
Akira Saito
Tomoki Yamashita
Published in:
Ars Comb. (2012)
Keyphrases
</>
spanning tree
small number
minimum spanning tree
undirected graph
minimum spanning trees
edge disjoint
computational complexity
worst case
random walk
euclidean distance
graph structure
weighted graph
minimum cost
graph theoretic
edge weights