169 search results - page 3 / 34 » Counting paths in digraphs |
ICALP
2010
Springer
13 years 9 months ago
2010
Springer
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...
ISAAC
2005
Springer
13 years 11 months ago
2005
Springer
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...
MFCS
2004
Springer
13 years 11 months ago
2004
Springer
Let G = (V, E) be a (directed) graph with vertex set V and edge (arc) set E. Given a set P of (source-sink) pairs of vertices of G, an important problem that arises in the computat...
TAMC
2010
Springer
13 years 10 months ago
2010
Springer
JCT
2007
13 years 5 months ago
2007