Login / Signup

Subexponential-Time Algorithms for Maximum Independent Set in $$P_t$$ P t -Free and Broom-Free Graphs.

Gábor BacsóDaniel LokshtanovDániel MarxMarcin PilipczukZsolt TuzaErik Jan van Leeuwen
Published in: Algorithmica (2019)
Keyphrases
  • graph theory
  • maximum independent set
  • learning algorithm
  • data structure
  • computational complexity
  • significant improvement
  • computational cost
  • association rules
  • theoretical analysis
  • graph theoretic