We present an O(m + n)-time algorithm that tests if a given directed graph is 2-vertex connected, where m is the number of arcs and n is the number of vertices. Based on this resul...
In this paper we present space-query trade-offs for external memory data structures that answer shortest path queries on planar directed graphs. For any S = Ω(N1+ ) and S = O(N2...
We survey results and open questions on complexity of parameterized problems on digraphs. The problems include the feedback vertex and arc set problems, induced subdigraph problem...
For digraphs D and H, a mapping f : V (D)V (H) is a homomorphism of D to H if uv A(D) implies f(u)f(v) A(H). For a fixed directed or undirected graph H and an input graph D, the...
We study the following two functions: d(n, c) and d(n, c); d(n, c) (d(n, c)) is the minimum number k such that every c-edge-colored undirected (directed) graph of order n and mini...