Sciweavers

325 search results - page 9 / 65
» Hamilton cycles in random graphs and directed graphs
Sort
View
GC
2010
Springer
14 years 10 months ago
Integer Functions on the Cycle Space and Edges of a Graph
A directed graph has a natural Z-module homomorphism from the underlying graph’s cycle space to Z where the image of an oriented cycle is the number of forward edges minus the n...
Daniel C. Slilaty
CPC
2010
88views more  CPC 2010»
14 years 9 months ago
Directed Graphs Without Short Cycles
Jacob Fox, Peter Keevash, Benny Sudakov
FSTTCS
2008
Springer
15 years 24 days ago
STCON in Directed Unique-Path Graphs
ABSTRACT. We study the problem of space-efficient polynomial-time algorithms for directed stconnectivity (STCON). Given a directed graph G, and a pair of vertices s, t, the STCON ...
Sampath Kannan, Sanjeev Khanna, Sudeepa Roy
JCB
2006
124views more  JCB 2006»
14 years 11 months ago
The Distribution of Genomic Distance between Random Genomes
We study the probability distribution of genomic distance d under the hypothesis of random gene order. We translate the random order assumption into a stochastic method for constr...
David Sankoff, Lani Haque