Local spanning trees in graphs and hypergraph decomposition with respect to edge connectivity.
Matthias KriesellPublished in: Electron. Notes Discret. Math. (1999)
Keyphrases
- spanning tree
- undirected graph
- minimum spanning trees
- weighted graph
- vertex set
- minimum spanning tree
- edge weights
- minimum cost
- edge disjoint
- adjacency matrix
- strongly connected
- minimum weight
- higher order
- connected components
- np hard
- graph connectivity
- graph structure
- shortest path
- pairwise
- edge detector
- random graphs
- heat kernel
- root node