983 search results - page 13 / 197 » Negative-Weight Cycle Algorithms |
131
Voted
WAOA
2005
Springer
15 years 8 months ago
2005
Springer
A cycle cover of a graph is a set of cycles such that every vertex is part of exactly one cycle. An L-cycle cover is a cycle cover in which the length of every cycle is in the set...
DCG
2010
15 years 2 months ago
2010
An essential cycle on a surface is a simple cycle that cannot be continuously deformed to a point or a single boundary. We describe algorithms to compute the shortest essential cy...
125
click to vote
JSAT
2008
15 years 2 months ago
2008
In this paper, we consider the problem of classifying Hamiltonian cycles in a binary hypercube. Previous work proposed a classification of these cycles using the edge representati...
108
click to vote
TALG
2010
14 years 9 months ago
2010
We give a polynomial-time algorithm to find a shortest contractible cycle (i.e. a closed walk without repeated vertices) in a graph embedded in a surface. This answers a question ...
127
click to vote
CORR
2008
Springer
15 years 2 months ago
2008
Springer
This paper presents a method to find new De Bruijn cycles based on ones of lesser order. This is done by mapping a De Bruijn cycle to several vertex disjoint cycles in a De Bruijn ...