64 search results - page 3 / 13 » Exact Elimination of Cycles in Graphs |
PDP
2007
IEEE
14 years 13 days ago
2007
IEEE
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 finite stat...
JGT
2007
13 years 6 months ago
2007
A graph is uniquely hamiltonian if it contains exactly one hamiltonian cycle. In this note we prove that there are no r-regular uniquely hamiltonian graphs when r > 22. This im...
STACS
2007
Springer
14 years 8 days ago
2007
Springer
We consider the problem of computing an approximate minimum cycle basis of an undirected non-negative edge-weighted graph G with m edges and n vertices; the extension to directed ...
ARSCOM
2004
13 years 6 months ago
2004
We show that every hamiltonian claw-free graph with a vertex x of degree d(x) 7 has a 2-factor consisting of exactly two cycles.
CPM
2005
Springer
13 years 11 months ago
2005
Springer
In this paper we propose new solution methods for designing tag sets for use in universal DNA arrays. First, we give integer linear programming formulations for two previous formal...