Search Sciweavers | Sciweavers

66 search results - page 1 / 14

» Cycles in dense digraphs

click to vote

COMBINATORICA
2008

95views more COMBINATORICA 2008»

Cycles in dense digraphs

14 years 9 months ago

Download www.math.princeton.edu

Maria Chudnovsky, Paul D. Seymour, Blair Sullivan

claim paper

Read More »

click to vote

EJC
2006

80views Information Technology» more EJC 2006»

Hamiltonicity of digraphs for universal cycles of permutations

14 years 9 months ago

Download www.lehigh.edu

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...

Garth Isaak

claim paper

Read More »

click to vote

SIAMDM
2008

101views more SIAMDM 2008»

Hamilton Cycles in Random Lifts of Directed Graphs

14 years 9 months ago

Download www.math.cmu.edu

An n-lift of a digraph K, is a digraph with vertex set V (K)

Prasad Chebolu, Alan M. Frieze

claim paper

Read More »

click to vote

EJC
2010

113views Information Technology» more EJC 2010»

Counting paths in digraphs

14 years 9 months ago

Download www.ornl.gov

Say a digraph is k-free if it has no directed cycles of length at most k, for k Z+ . Thomass

Paul D. Seymour, Blair Sullivan

claim paper

Read More »

click to vote

ISAAC
1994
Springer

95views Algorithms» more ISAAC 1994»

Efficient Sequential and Parallel Algorithms for the Negative Cycle Problem

15 years 1 months ago

Download www.ceid.upatras.gr

We present here an algorithm for detecting (and outputting, if exists) a negative cycle in an n-vertex planar digraph G with real

Dimitris J. Kavvadias, Grammati E. Pantziou, Paul ...

claim paper

Read More »

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

Sciweavers

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers