Locally connected spanning trees in cographs, complements of bipartite graphs and doubly chordal graphs.
B. S. PandaDinabandhu PradhanPublished in: Inf. Process. Lett. (2010)
Keyphrases
- bipartite graph
- spanning tree
- undirected graph
- minimum weight
- edge weights
- maximum cardinality
- minimum spanning tree
- minimum spanning trees
- edge disjoint
- minimum cost
- graph model
- maximum matching
- graph clustering
- weighted graph
- link prediction
- maximum weight
- connected components
- bipartite networks
- mutual reinforcement
- times faster
- bipartite graph matching
- random walk
- information retrieval