Sciweavers

66 search results - page 4 / 14

» Cycles in dense digraphs

62

DISOPT
2006

48views more DISOPT 2006»

Finding cheapest cycles in vertex-weighted quasi-transitive and extended semicomplete digraphs

14 years 9 months ago

Finding cheapest cycles in vertex-weighted quasi-transitive and extended semicomplete digraphs

Download eprints.pascal-network.org

Jørgen Bang-Jensen, Gregory Gutin, Anders Y...

claim paper

Read More »

57

JCT
2008

57views more JCT 2008»

k-Ordered Hamilton cycles in digraphs

14 years 9 months ago

k-Ordered Hamilton cycles in digraphs

Download web.mat.bham.ac.uk

Daniela Kühn, Deryk Osthus, Andrew Young

claim paper

Read More »

56

JCT
2002

54views more JCT 2002»

Disjoint Cycles in Eulerian Digraphs and the Diameter of Interchange Graphs

14 years 9 months ago

Disjoint Cycles in Eulerian Digraphs and the Diameter of Interchange Graphs

Download uweb.txstate.edu

Richard A. Brualdi, Jian Shen

claim paper

Read More »

51

SIAMDM
2010

103views more SIAMDM 2010»

A Semiexact Degree Condition for Hamilton Cycles in Digraphs

14 years 8 months ago

A Semiexact Degree Condition for Hamilton Cycles in Digraphs

Download christofides.org

Demetres Christofides, Peter Keevash, Daniela K&uu...

claim paper

Read More »

87

AAIM
2008
Springer

120views Algorithms» more AAIM 2008»

Minimum Cost Homomorphism Dichotomy for Oriented Cycles

15 years 4 months ago

Minimum Cost Homomorphism Dichotomy for Oriented Cycles

Download www.cs.rhul.ac.uk

For digraphs D and H, a mapping f : V (D)→V (H) is a homomorphism of D to H if uv ∈ A(D) implies f(u)f(v) ∈ A(H). If, moreover, each vertex u ∈ V (D) is associated with co...

Gregory Gutin, Arash Rafiey, Anders Yeo

claim paper

Read More »

« Prev « First page 4 / 14 Last » Next »