Login / Signup
A decomposition of complete bipartite graphs into edge-disjoint subgraphs with star components.
Yoshimi Egawa
Masatsugu Urabe
Toshihito Fukuda
Seiichiro Nagoya
Published in:
Discret. Math. (1986)
Keyphrases
</>
bipartite graph
edge disjoint
maximum matching
spanning tree
graph model
minimum weight
link prediction
graph clustering
maximum weight
bipartite graph matching
computational complexity
graph mining
maximum cardinality
lower bound
total length
bipartite networks
labeled graphs
affinity graph