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)ε
We study the problem defined by Erd˝os and Szemer�edi in 1975 of constructing sparse depthrobust grap...
AbstractIt is shown that a graph with n vertices and more than n · log2n edges can be uniquely recon...
The graph removal lemma states that any graph on n vertices with o(n^h) copies of a fixed graph H on...
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 ...
Abstract. A connected graph has tree-depth at most k if it is a sub-graph of the closure of a rooted...
AbstractWe investigate the relative complexity of the graph isomorphism problem (GI) and problems re...
We consider the following problem: can a certain graph parameter of some given graph G be reduced by...
Let $\lambda(G)$ denote the smallest number of vertices that can be removed from a non-empty graph $...
We consider the following problem: can a certain graph parameter of some given graph G be reduced by...
Let G be a weighted, directed, acyclic graph in which each edge weight is not a static quantity, but...
We investigate the smallest number λe(G) of edges that can be removed from a non-empty graph G so th...
We consider the following problem: can a certain graph parameter of some given graph G be reduced b...
toni0cs. pitt. edu We consider the problem of determining, given a graph G and specified nodes s and...
If G is a graph on p vertices with connectivity, or edge-connectivity, or minimum valency, at least ...
We study the problem defined by Erd˝os and Szemer�edi in 1975 of constructing sparse depthrobust grap...
AbstractIt is shown that a graph with n vertices and more than n · log2n edges can be uniquely recon...
The graph removal lemma states that any graph on n vertices with o(n^h) copies of a fixed graph H on...
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 ...
Abstract. A connected graph has tree-depth at most k if it is a sub-graph of the closure of a rooted...
AbstractWe investigate the relative complexity of the graph isomorphism problem (GI) and problems re...
We consider the following problem: can a certain graph parameter of some given graph G be reduced by...
Let $\lambda(G)$ denote the smallest number of vertices that can be removed from a non-empty graph $...
We consider the following problem: can a certain graph parameter of some given graph G be reduced by...
Let G be a weighted, directed, acyclic graph in which each edge weight is not a static quantity, but...
We investigate the smallest number λe(G) of edges that can be removed from a non-empty graph G so th...
We consider the following problem: can a certain graph parameter of some given graph G be reduced b...
toni0cs. pitt. edu We consider the problem of determining, given a graph G and specified nodes s and...
If G is a graph on p vertices with connectivity, or edge-connectivity, or minimum valency, at least ...
We study the problem defined by Erd˝os and Szemer�edi in 1975 of constructing sparse depthrobust grap...
AbstractIt is shown that a graph with n vertices and more than n · log2n edges can be uniquely recon...
The graph removal lemma states that any graph on n vertices with o(n^h) copies of a fixed graph H on...
Add to ORKG