Login / Signup

Faster exponential-time algorithms in graphs of bounded average degree.

Marek CyganMarcin Pilipczuk
Published in: Inf. Comput. (2015)
Keyphrases
  • average degree
  • graph theory
  • computational complexity
  • theoretical analysis
  • learning algorithm
  • worst case