33 search results - page 6 / 7 » Self-complementary circulant graphs |
CVPR
2011
IEEE
13 years 2 months ago
2011
IEEE
The problem of finding one-dimensional structures in images and videos can be formulated as a problem of searching for cycles in graphs. In [11], an untangling-cycle cost functio...
TC
1998
13 years 7 months ago
1998
—Loop networks (or Hamiltonian circulant graphs) are a popular class of fault-tolerant network topologies which include rings and complete graphs. For this class, the fundamental...
STOC
2009
ACM
14 years 8 months ago
2009
ACM
We describe the first algorithm to compute maximum flows in surface-embedded graphs in near-linear time. Specifically, given a graph embedded on a surface of genus g, with two spe...
IPPS
2009
IEEE
14 years 2 months ago
2009
IEEE
4 Automatic differentiation is the primary means of obtaining analytic5 derivatives from a numerical model given as a computer program. There-6 fore, it is an essential productivi...
JGT
2010
13 years 5 months ago
2010
: Jacobson, Levin, and Scheinerman introduced the fractional Ramsey function rf (a1,a2, ...,ak) as an extension of the classical definition for Ramsey numbers. They determined an e...