Results 1  10
of
232
The Hamiltonian Circuit Polytope
"... The hamiltonian circuit polytope is the convex hull of feasible solutions for the circuit constraint, which provides a succinct formulation of the traveling salesman and other sequencing problems without using 0–1 variables. We study the polytope by establishing its dimension, developing tools for ..."
Abstract

Cited by 2 (2 self)
 Add to MetaCart
The hamiltonian circuit polytope is the convex hull of feasible solutions for the circuit constraint, which provides a succinct formulation of the traveling salesman and other sequencing problems without using 0–1 variables. We study the polytope by establishing its dimension, developing tools
On Tournaments Having A Unique Hamiltonian Circuit
, 1977
"... A tournament is a directed complete graph. A Hamiltonian circuit is a circuit which passes through each vertex of the graph once and only once. This note examines the family T of all nonisomorphic tournaments on n vertices which n have a unique Hamiltonian circuit. We let T = IT I. In [1] Douglas gi ..."
Abstract
 Add to MetaCart
A tournament is a directed complete graph. A Hamiltonian circuit is a circuit which passes through each vertex of the graph once and only once. This note examines the family T of all nonisomorphic tournaments on n vertices which n have a unique Hamiltonian circuit. We let T = IT I. In [1] Douglas
Enumeration of hamiltonian circuits in rectangular grids
 J. Combin. Math. Combin. Comput
, 1996
"... [ Note: this article has been accepted for publication by the ..."
Abstract

Cited by 2 (0 self)
 Add to MetaCart
[ Note: this article has been accepted for publication by the
Complete Sets of Hamiltonian Circuits for Classification of Documents
"... Abstract. The calculation of Hamiltonian Circuits is an NPcomplete task. This paper uses slightly modified complete sets of Hamiltonian circuits for the classification of documents. The known solution method is based on a SATinstance with a huge number of clauses which is flattening the knowledge ..."
Abstract

Cited by 2 (2 self)
 Add to MetaCart
Abstract. The calculation of Hamiltonian Circuits is an NPcomplete task. This paper uses slightly modified complete sets of Hamiltonian circuits for the classification of documents. The known solution method is based on a SATinstance with a huge number of clauses which is flattening the knowledge
A Simple Subexponential Time Algorithm for Hamiltonian Circuit
, 1998
"... Let ff satisfy OE = p 5 + 1 2 ! ff ! 2 : We present an algorithm which counts the number of Hamiltonian circuits in a graph and which runs in time 2 O((log(n)) 3 \Deltan log ff ) : Logarithms are binary. The constant implied by O(\Delta) notation behaves like 1=ffl, where ffl = ff \Gamma ..."
Abstract
 Add to MetaCart
Let ff satisfy OE = p 5 + 1 2 ! ff ! 2 : We present an algorithm which counts the number of Hamiltonian circuits in a graph and which runs in time 2 O((log(n)) 3 \Deltan log ff ) : Logarithms are binary. The constant implied by O(\Delta) notation behaves like 1=ffl, where ffl = ff
Functional Approach for Hamiltonian Circuit and Graph Isomorphism Problems
, 2009
"... The aim of this work is to establish relation between wellknown basic problems of cryptanalysis [1],[2] as Hamiltonian Circuit and Subgraph Isomorphism problems and global optimization problem for classes of functionals constructed as sums of low dimensional polynomials. Let’s consider for arbitrar ..."
Abstract
 Add to MetaCart
The aim of this work is to establish relation between wellknown basic problems of cryptanalysis [1],[2] as Hamiltonian Circuit and Subgraph Isomorphism problems and global optimization problem for classes of functionals constructed as sums of low dimensional polynomials. Let’s consider
Threeconnected graphs with only one Hamiltonian circuit 1
"... We will call graph 1Hgraph if it is threeconnected and it has only one Hamiltonian circuit (Hcircuit). We will say that in the graph G three distinct vertices x, y, z in the given order comprise special triplet – shorter, striplet {x, y, z} if 1) there is only one Hamiltonian chain (Hchain) [x.. ..."
Abstract
 Add to MetaCart
We will call graph 1Hgraph if it is threeconnected and it has only one Hamiltonian circuit (Hcircuit). We will say that in the graph G three distinct vertices x, y, z in the given order comprise special triplet – shorter, striplet {x, y, z} if 1) there is only one Hamiltonian chain (Hchain) [x
AN ALGORITHM WHICH GENERATES THE HAMILTONIAN CIRCUITS OF A CUBIC PLANAR MAP
"... The paper describes an algorithm which generates those Hamiltonian circuits of a given cubic planar map which include some chosen edge of the map. A simple extension of the method results in the generation of all the Hamiltonian circuits of the map. The algorithm can readily be implemented on a digi ..."
Abstract
 Add to MetaCart
The paper describes an algorithm which generates those Hamiltonian circuits of a given cubic planar map which include some chosen edge of the map. A simple extension of the method results in the generation of all the Hamiltonian circuits of the map. The algorithm can readily be implemented on a
FaultTolerant Embeddings Of Hamiltonian Circuits In kAry nCubes
 SIAM JOURNAL ON DISCRETE MATHEMATICS
, 2002
"... We consider the faulttolerant capabilities of networks of processors whose underlying topology is that of the kary ncube Q n , where k 3 and n 2. In particular, given a copy of Q where some of the interprocessor links may be faulty but where every processor is incident with at least two he ..."
Abstract

Cited by 11 (2 self)
 Add to MetaCart
healthy links, we show that if the number of faults is at most 4n 5 then Q n still contains a Hamiltonian circuit; but that there are situations where the number of faults is 4n 4 (and every processor is incident with at least two healthy links) and no Hamiltonian circuit exists. We also remark
Results 1  10
of
232