Login / Signup

Independent Set on $\mathrm{P}_{k}$-Free Graphs in Quasi-Polynomial Time.

Peter GartlandDaniel Lokshtanov
Published in: FOCS (2020)
Keyphrases
  • independent set
  • maximum independent set
  • computational complexity
  • special case
  • maximum weight
  • worst case
  • approximation algorithms
  • learning algorithm
  • social networks
  • bayesian networks
  • bipartite graph