Skip to search formSkip to main contentSkip to account menu

Tree-depth

Known as: Treedepth 
In graph theory, the tree-depth of a connected undirected graph G is a numerical invariant of G, the minimum height of a Trémaux tree for a… 
Wikipedia (opens in a new tab)

Related topics

Related topics

33 relations
1-planar graphApproximation algorithmChordal completionCircuit rank

Broader (1)

Graph coloring

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2018
Highly Cited
2018
A Parameterized Strongly Polynomial Algorithm for Block Structured Integer Programs
The theory of $n$-fold integer programming has been recently emerging as an important tool in parameterized complexity. The input… 
Highly Cited
2018
Highly Cited
2018
First-Order Interpretations of Bounded Expansion Classes
The notion of bounded expansion captures uniform sparsity of graph classes and renders various algorithmic problems that are hard… 
2018
2018
Polynomial bounds for centered colorings on proper minor-closed graph classes
For $p\in \mathbb{N}$, a coloring $\lambda$ of the vertices of a graph $G$ is {\em{$p$-centered}} if for every connected subgraph… 
2016
2016
Treedepth Parameterized by Vertex Cover Number
To solve hard graph problems from the parameterized perspective, structural parameters have commonly been used. In particular… 
2014
2014
Structural Parameterizations of the Mixed Chinese Postman Problem
In the Mixed Chinese Postman Problem (MCPP), given a weighted mixed graph G (G may have both edges and arcs), our aim is to find… 
Review
2014
Review
2014
On Low Tree-Depth Decompositions
The theory of sparse structures usually uses tree like structures as building blocks. In the context of sparse/dense dichotomy… 
2014
2014
Reconfiguration and structural graph theory
Reconfiguration of a combinatorial problem is the application of small transformations to a solution of the problem in a way that… 
2013
2013
A Model Theory Approach to Structural Limits
The goal of this paper is to unify two lines in a particular area of graph limits. First, we generalize and provide unified… 
Highly Cited
2013
Highly Cited
2013
Kernelization Using Structural Parameters on Sparse Graph Classes
Meta-theorems for polynomial (linear) kernels have been the subject of intensive research in parameterized complexity. Heretofore… 
2011
2011
Thue choosability of trees
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy (opens in a new tab), Terms of Service (opens in a new tab), and Dataset License (opens in a new tab)