8 search results - page 2 / 2 » Linkedness and Ordered Cycles in Digraphs |
WG
2004
Springer
13 years 11 months ago
2004
Springer
Let be the following strategy to construct a walk in a labeled digraph: at each vertex, we follow the unvisited arc of minimum label. In this work we study for which languages, app...
CORR
2007
Springer
13 years 6 months ago
2007
Springer
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...
FOCS
1994
IEEE
13 years 10 months ago
1994
IEEE
We describe algorithms for finding the k shortest paths connecting a given pair of vertices in a digraph (allowing cycles). Our algorithms output an implicit representation of the...