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:
SODA (2022)
Keyphrases
</>
information extraction
computational complexity
worst case
learning algorithm
dynamic programming
graph isomorphism
databases
graph structure
cost function
np hard
knapsack problem
social networks
objective function
spanning tree
graph theoretic
independent set