Login / Signup

Sparse graphs with bounded induced cycle packing number have logarithmic treewidth.

Marthe BonamyÉdouard BonnetHugues DéprésLouis EsperetColin GenietClaire HilaireStéphan ThomasséAlexandra Wesolek
Published in: CoRR (2022)
Keyphrases
  • small number
  • maximum number
  • bounded treewidth
  • upper bound
  • space complexity
  • face recognition
  • worst case
  • spanning tree
  • graph theoretic
  • reduced set