Spanning Trees with Many Leaves in Regular Bipartite Graphs.
Emanuele G. FuscoAngelo MontiPublished in: ISAAC (2007)
Keyphrases
- bipartite graph
- spanning tree
- edge disjoint
- minimum weight
- minimum cost
- edge weights
- minimum spanning trees
- minimum spanning tree
- maximum matching
- maximum cardinality
- undirected graph
- link prediction
- graph clustering
- bipartite graph matching
- weighted graph
- data sets
- total length
- leaf nodes
- special case
- machine learning