Login / Signup
Polynomial-time algorithm for Maximum Independent Set in bounded-degree graphs with no long induced claws.
Tara Abrishami
Maria Chudnovsky
Cemil Dibek
Pawel Rzazewski
Published in:
CoRR (2021)
Keyphrases
</>
learning algorithm
computational complexity
simulated annealing
cost function
dynamic programming
graph structure
minimum spanning tree
objective function
spanning tree
graph isomorphism
optimal solution
search space
social network analysis
undirected graph