Login / Signup

Tight bound on treedepth in terms of pathwidth and longest path.

Meike HatzelGwenaël JoretPiotr MicekMarcin PilipczukTorsten UeckerdtBartosz Walczak
Published in: CoRR (2023)
Keyphrases
  • lower bound
  • upper bound
  • worst case
  • data sets
  • decision making
  • generalization error bounds
  • decision trees
  • case study
  • database systems
  • digital libraries
  • relational databases
  • co occurrence