Search Sciweavers | Sciweavers

325 search results - page 4 / 65

» Hamilton cycles in random graphs and directed graphs

click to vote

COCOON
2003
Springer

109views Combinatorics» more COCOON 2003»

Fault-Hamiltonicity of Product Graph of Path and Cycle

14 years 21 days ago

Download tcs.cuk.ac.kr

We investigate hamiltonian properties of Pm × Cn, m ≥ 2 and even n ≥ 4, which is bipartite, in the presence of faulty vertices and/or edges. We show that Pm×Cn with n even is...

Jung-Heum Park, Hee-Chul Kim

claim paper

Read More »

click to vote

PDP
2007
IEEE

101views Distributed And Parallel Com...» more PDP 2007»

Parallel-External Computation of the Cycle Structure of Invertible Cryptographic Functions

14 years 1 months ago

Download pv.fernuni-hagen.de

We present an algorithm to compute the cycle structure of large directed graphs where each node has exactly one outgoing edge. Such graphs appear as state diagrams of ﬁnite stat...

Andreas Beckmann, Jorg Keller

claim paper

Read More »

click to vote

SODA
1994
ACM

81views Algorithms» more SODA 1994»

Approximately Counting Hamilton Cycles in Dense Graphs

13 years 8 months ago

Download www.math.cmu.edu

Martin E. Dyer, Alan M. Frieze, Mark Jerrum

claim paper

Read More »