5 search results - page 1 / 1 » Almost Given Length Cycles in Digraphs |
GC
2008
Springer
13 years 4 months ago
2008
Springer
For a directed graph G without loops or parallel edges, let (G) denote the size of the smallest feedback arc set, i.e., the smallest subset X E(G) such that G \ X has no directed...
COMBINATORICS
2006
13 years 4 months ago
2006
The set of cycle lengths of almost all permutations in Sn are "Poisson distributed": we show that this remains true even when we restrict the number of cycles in the per...
ARSCOM
1998
13 years 4 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...
FOCS
1994
IEEE
13 years 8 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...
BC
2000
13 years 4 months ago
2000
The gait transition in legged animals has attracted many researchers, and its relation to metabolic cost and mechanical work has been discussed in recent decades. We assumed that t...