How to Use
Select graph:
- sd: Shrub-depth
- Model: Tree+labels
- td: Compare
Tree Model
Build a rooted tree T. Vertices of G are leaves. Each leaf gets a label (bounded number). Adjacency: two leaves connected iff their labels and least common ancestor in T satisfy a connection rule.
Parameter Hierarchy
Bounded shrub-depth implies bounded clique-width. Shrub-depth is to clique-width what treedepth is to treewidth — a depth-bounded version. Captures graphs with shallow dense structure.
Step-by-Step Instructions
- 1Select graph.
- 2Build tree model.
- 3Assign labels.
- 4Set connections.
- 5Measure depth.