DOIAbstract
AbstractA family of directed acyclic graphs Gn with 2n+1−1 nodes, n · 2n edges and depth 2n+1−2 is constructed having the property: For any ε (0⩽ε<1) it is necessary to remove ω(n · 2n) edges in order to reduce the depth of Gn to (2n)ε
AbstractA family of directed acyclic graphs Gn with 2n+1−1 nodes, n · 2n edges and depth 2n+1−2 is constructed having the property: For any ε (0⩽ε<1) it is necessary to remove ω(n · 2n) edges in order to reduce the depth of Gn to (2n)ε
International audienceWe investigate the problem of partitioning the vertices of a directed acyclic ...
We investigate the problem of partitioning the vertices of a directed acyclic graph into a given num...
A conjecture by Thorup is that the diameter of a directed graph with n vertices and m edges can be r...
AbstractA family of directed acyclic graphs Gn with 2n+1−1 nodes, n · 2n edges and depth 2n+1−2 is c...
AbstractThis note proves the existence of acyclic directed graphs of logarithmic depth, such that a ...
Let G be a weighted, directed, acyclic graph in which each edge weight is not a static quantity, but...
AbstractA graph G is said to have depth δ if every path of length δ + 1 is contained in a shortest c...
Abstract. A connected graph has tree-depth at most k if it is a sub-graph of the closure of a rooted...
AbstractFor every positive integer k, we present an oriented graph Gk such that deleting any vertex ...
The depth of a flow graph is the maximum number of back edges in an acyclic path, where a back edge ...
AbstractLet D(G) be the minimum quantifier depth of a first order sentence Φ that defines a graph G ...
AbstractIt is proved that by deleting at most 5 edges every planar (simple) graph of order at least ...
We study the problem defined by Erd˝os and Szemer�edi in 1975 of constructing sparse depthrobust grap...
AbstractIf π is a property on graphs, the corresponding edge deletion (edge contraction, respectivel...
. A subset S of the vertices of a directed acyclic graph is called glb-closed, if it contains the gr...
International audienceWe investigate the problem of partitioning the vertices of a directed acyclic ...
We investigate the problem of partitioning the vertices of a directed acyclic graph into a given num...
A conjecture by Thorup is that the diameter of a directed graph with n vertices and m edges can be r...
AbstractA family of directed acyclic graphs Gn with 2n+1−1 nodes, n · 2n edges and depth 2n+1−2 is c...
AbstractThis note proves the existence of acyclic directed graphs of logarithmic depth, such that a ...
Let G be a weighted, directed, acyclic graph in which each edge weight is not a static quantity, but...
AbstractA graph G is said to have depth δ if every path of length δ + 1 is contained in a shortest c...
Abstract. A connected graph has tree-depth at most k if it is a sub-graph of the closure of a rooted...
AbstractFor every positive integer k, we present an oriented graph Gk such that deleting any vertex ...
The depth of a flow graph is the maximum number of back edges in an acyclic path, where a back edge ...
AbstractLet D(G) be the minimum quantifier depth of a first order sentence Φ that defines a graph G ...
AbstractIt is proved that by deleting at most 5 edges every planar (simple) graph of order at least ...
We study the problem defined by Erd˝os and Szemer�edi in 1975 of constructing sparse depthrobust grap...
AbstractIf π is a property on graphs, the corresponding edge deletion (edge contraction, respectivel...
. A subset S of the vertices of a directed acyclic graph is called glb-closed, if it contains the gr...
International audienceWe investigate the problem of partitioning the vertices of a directed acyclic ...
We investigate the problem of partitioning the vertices of a directed acyclic graph into a given num...
A conjecture by Thorup is that the diameter of a directed graph with n vertices and m edges can be r...
Add to ORKG