Packing of rigid spanning subgraphs and spanning trees.

Joseph Cheriyan Olivier Durand de Gevigney Zoltán Szigeti

Published in: J. Comb. Theory, Ser. B (2014)

Keyphrases

spanning tree
edge disjoint
minimum spanning tree
minimum cost
packing problem
minimum spanning trees
data structure
depth first search
graph mining
weighted graph
three dimensional
root node
undirected graph
graph data
total length
graph databases
graph theory
lower bound