# Tree-depth

## Papers overview

Semantic Scholar uses AI to extract papers important to this topic.

2017

2017

- Theory of Computing Systems
- 2017

Dynamic programming is widely used for exact computations based on tree decompositions of graphs. However, the space complexity… (More)

Is this relevant?

2017

2017

- IPEC
- 2017

In the last years, kernelization with structural parameters has been an active area of research within the field of parameterized… (More)

Is this relevant?

2016

2016

- Discrete Mathematics
- 2016

A k-ranking of a graph G is a labeling of the vertices of G with values from {1, . . . , k} such that any path joining two… (More)

Is this relevant?

2016

2016

- Eur. J. Comb.
- 2016

In a recent paper [6], Kwon and Oum claim that every graph of bounded rank-width is a pivot-minor of a graph of bounded tree… (More)

Is this relevant?

2014

2014

- Discrete Applied Mathematics
- 2014

The tree-depth of a graph G is a parameter that plays a crucial role in the theory of bounded expansion classes and has been… (More)

Is this relevant?

2013

2013

- ArXiv
- 2013

We present a dynamic data structure for representing a graph G with tree-depth at most D. Tree-depth is an important graph… (More)

Is this relevant?

2012

2012

- Eur. J. Comb.
- 2012

For every k ≥ 0, we define Gk as the class of graphs with treedepth at most k, i.e. the class containing every graph G admitting… (More)

Is this relevant?

2012

2012

- MFCS
- 2012

Recent characterization [9] of those graphs for which coloured MSO2 model checking is fast raised the interest in the graph… (More)

Is this relevant?

2009

2009

- Electronic Notes in Discrete Mathematics
- 2009

For every k ≥ 0, we define Gk as the class of graphs with tree-depth at most k, i.e. the class containing every graph G admitting… (More)

Is this relevant?

Highly Cited

2006

Highly Cited

2006

- Eur. J. Comb.
- 2006

We define the notions tree-depth and upper chromatic number of a graph and show their relevance to local–global problems for… (More)

Is this relevant?