Edge-disjoint trees containing some given vertices in a graph.
Matthias KriesellPublished in: J. Comb. Theory, Ser. B (2003)
Keyphrases
- edge disjoint
- spanning tree
- minimum weight
- undirected graph
- weighted graph
- edge weights
- total length
- leaf nodes
- minimum cost
- minimum spanning tree
- root node
- attributed graphs
- tree structure
- decision trees
- hamiltonian cycle
- labeled graphs
- random walk
- adjacency matrix
- random graphs
- graph structure
- running times
- graph mining
- maximum matching
- maximal cliques
- planar graphs
- vertex set
- graph partitioning
- connected graphs
- directed edges
- bipartite graph