Bipartite Graphs Totally Decomposable by Canonical Decomposition.
Jean-Luc FouquetVassilis GiakoumakisJean-Marie VanherpePublished in: Int. J. Found. Comput. Sci. (1999)
Keyphrases
- bipartite graph
- maximum matching
- canonical form
- link prediction
- maximum cardinality
- minimum weight
- graph clustering
- edge weights
- maximum weight
- data sets
- np complete
- machine learning
- bipartite graph matching
- supervised learning
- co occurrence
- web search engines
- greedy algorithm
- learning process
- social networks
- search engine
- bipartite networks