Login / Signup

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

Marthe BonamyEdouard BonnetHugues DéprésLouis EsperetColin GenietClaire HilaireStéphan ThomasséAlexandra Wesolek
Published in: SODA (2023)
Keyphrases
  • database
  • small number
  • directed graph
  • space complexity
  • random graphs
  • bounded treewidth
  • feature selection
  • search algorithm
  • data model
  • upper bound
  • graph theoretic