66 search results - page 1 / 14 » Cycles in dense digraphs |
COMBINATORICA
2008
13 years 6 months ago
2008
EJC
2006
13 years 6 months ago
2006
The digraphs P(n, k) have vertices corresponding to length k permutations of an n set and arcs corresponding to (k + 1) permutations. Answering a question of Starling, Klerlein, K...
SIAMDM
2008
13 years 6 months ago
2008
An n-lift of a digraph K, is a digraph with vertex set V (K)
EJC
2010
13 years 6 months ago
2010
Say a digraph is k-free if it has no directed cycles of length at most k, for k Z+ . Thomass
ISAAC
1994
Springer
13 years 10 months ago
1994
Springer
We present here an algorithm for detecting (and outputting, if exists) a negative cycle in an n-vertex planar digraph G with real