Add to ORKGAbstract. A connected graph has tree-depth at most k if it is a sub-graph of the closure of a rooted tree whose height is at most k. We give an algorithm which for a given n-vertex graph G, in time O(1.9602n) computes the tree-depth of G. Our algorithm is based on combinatorial results revealing the structure of minimal rooted trees whose closures contain G.
. This paper shows that for a strongly connected planar directed graph of size n, a depth-first sear...
In this paper we present a parallel algorithm that decides whether a graph G has treewidth at most t...
International audienceDuring the last decade, metric properties of the bags of tree decompositions o...
AbstractWe resolve the computational complexity of determining the treelength of a graph, thereby so...
The length of a tree-decomposition of a graph is the maximum distance between two vertices of a same...
International audienceThe length of a tree-decomposition of a graph is the maximum distance (in the ...
© 2020 The Author(s). We present a concept called the branch-depth of a connectivity function, that ...
A graph G has tree-width at most w if it admits a tree-decomposition of width ≤ w. It is known that ...
Recent characterization [9] of those graphs for which coloured MSO2 model checking is fast raised th...
We prove that the problem of finding, in an undirected graph with non-negative costs on edges, a min...
The depth of a flow graph is the maximum number of back edges in an acyclic path, where a back edge ...
We show that the treewidth and the minimum fill-in of an n-vertex graph can be computed in time O(1....
The level-ancestor problem is considered. Suppose a rooted tree T is given for preprocessing. Answer...
Shrub-depth is a width measure of graphs which, roughly speaking, corresponds to the smallest depth ...
Abstract. Computing the Pathwidth of a graph is the problem of finding a tree decomposition of minim...
. This paper shows that for a strongly connected planar directed graph of size n, a depth-first sear...
In this paper we present a parallel algorithm that decides whether a graph G has treewidth at most t...
International audienceDuring the last decade, metric properties of the bags of tree decompositions o...
AbstractWe resolve the computational complexity of determining the treelength of a graph, thereby so...
The length of a tree-decomposition of a graph is the maximum distance between two vertices of a same...
International audienceThe length of a tree-decomposition of a graph is the maximum distance (in the ...
© 2020 The Author(s). We present a concept called the branch-depth of a connectivity function, that ...
A graph G has tree-width at most w if it admits a tree-decomposition of width ≤ w. It is known that ...
Recent characterization [9] of those graphs for which coloured MSO2 model checking is fast raised th...
We prove that the problem of finding, in an undirected graph with non-negative costs on edges, a min...
The depth of a flow graph is the maximum number of back edges in an acyclic path, where a back edge ...
We show that the treewidth and the minimum fill-in of an n-vertex graph can be computed in time O(1....
The level-ancestor problem is considered. Suppose a rooted tree T is given for preprocessing. Answer...
Shrub-depth is a width measure of graphs which, roughly speaking, corresponds to the smallest depth ...
Abstract. Computing the Pathwidth of a graph is the problem of finding a tree decomposition of minim...
. This paper shows that for a strongly connected planar directed graph of size n, a depth-first sear...
In this paper we present a parallel algorithm that decides whether a graph G has treewidth at most t...
International audienceDuring the last decade, metric properties of the bags of tree decompositions o...