169 search results - page 2 / 34 » Counting paths in digraphs |
JCT
2006
13 years 5 months ago
2006
An (n, N)
ENDM
2010
13 years 2 months ago
2010
The Eulerian closed walk problem in a digraph is a well-known polynomial-time solvable problem. In this paper, we show that if we impose the feasible solutions to fulfill some pre...
DAM
2008
13 years 4 months ago
2008
A digraph D is strong if it contains a directed path from x to y for every choice of vertices x, y in D. We consider the problem (MSSS) of finding the minimum number of arcs in a ...
APPROX
2004
Springer
13 years 10 months ago
2004
Springer
The central observation of this paper is that if Ç«n random arcs are added to any n-node strongly connected digraph with bounded degree then the resulting graph has diameter O(ln ...
ICALP
1995
Springer
13 years 8 months ago
1995
Springer
We consider the problem of preprocessing an n-vertex digraph with real edge weights so that subsequent queries for the shortest path or distance between any two vertices can be efï...