On the Phase Transition of Finding a Biclique in a larger Bipartite Graph.
Roberto AlonsoRaúl MonroyEduardo AguirrePublished in: CoRR (2016)
Keyphrases
- bipartite graph
- phase transition
- constraint satisfaction
- randomly generated
- satisfiability problem
- maximum matching
- minimum weight
- link prediction
- hard problems
- np complete
- random instances
- maximum cardinality
- sat problem
- hits algorithm
- random constraint satisfaction problems
- np complete problems
- graph model
- graph coloring
- training data
- machine learning
- bipartite graph matching
- maximum weight
- random walk
- special case
- pairwise