Advice Complexity of Maximum Independent set in Sparse and Bipartite Graphs.

Stefan Dobrev Rastislav Královic Richard Královic

Published in: Theory Comput. Syst. (2015)

Keyphrases

bipartite graph
maximum independent set
maximum matching
minimum weight
independent set
link prediction
machine learning
maximum weight
graph theory
graph theoretic
mutual reinforcement
affinity graph
bipartite graph matching
computational complexity
graph clustering
random walk
maximum cardinality