169 search results - page 6 / 34 » Counting paths in digraphs |
COCOON
2010
Springer
13 years 10 months ago
2010
Springer
DICTA
2003
13 years 8 months ago
2003
Human-Machine interfaces play a role of growing importance as computer technology continues to evolve. Motivated by the desire to provide users with an intuitive gesture input syst...
FOCS
1994
IEEE
13 years 11 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...
ARSCOM
1998
13 years 7 months ago
1998
Some results relating to the road-coloring conjecture of Alder, Goodwyn, and Weiss, which give rise to an O(n2) algorithm to determine whether or not a given edge-coloring of a gra...
SIROCCO
2003
13 years 8 months ago
2003
For networks employing shortest-path routing, we introduce a new recovery scheme which needs only one backup routing table. By precomputing this backup table, the network recovers...