Treedepth Calculator

elimination tree depth

All Tools

Loading tool...

About Treedepth Calculator

A treedepth calculator computing td(G): minimum depth of a DFS tree of a supergraph H ⊇ G. Equivalently: minimum height of an elimination tree. td ≥ pw+1 ≥ tw+1. td = ⌈log₂ n⌉ for paths. Bounded td = bounded expansion classes. Client-side.

Treedepth Calculator Features

  • td(G)
  • DFS depth
  • ≥pw+1
  • log n paths
  • Common graphs
Advertisement
Advertisement