Results 11  20
of
232
Finding Hamiltonian Circuits in Arrangements of Jordan Curves is NPComplete
 Information Processing Letters 52
, 1994
"... Let A = fC 1 ; C 2 ; : : : ; C n g be an arrangement of Jordan curves in the plane lying in general position, i.e., every curve properly intersects at least one other curve, no two curves touch each other and no three meet at a common intersection point. The Jordancurve arrangement graph of A has as ..."
Abstract

Cited by 4 (0 self)
 Add to MetaCart
whether Jordancurve arrangement graphs are Hamiltonian is NPcomplete. KEYWORDS NPcompleteness; Hamiltonian circuit; arrangements of Jordan curves; computational complexity; computational geometry 1 Introduction A Hamiltonian circuit in a graph is a circuit which passes through every vertex
Reducedbymatching graphs: toward simplifying Hamiltonian circuit problem
"... The results presented in the paper are threefold. Firstly, a new class of reducedbymatching directed graphs is defined and its properties studied. The graphs are output from the algorithm which, for a given 1graph, removes arcs which are unnecessary from the point of view of searching for a Hami ..."
Abstract
 Add to MetaCart
Hamiltonian circuit. In the best case, the graph is reduced to a quasiadjoint graph, what results in polynomialtime solution of the Hamiltonian circuit problem. Secondly, the systematization of several classes of digraphs, known from the literature and referring to directed line graphs, is provided
Reconstructing a Hamiltonian Circuit by Querying the Graph: Application to DNA Physical Mapping
 INRIALorraine and CRIN/CNRS, Campus Scientifique, 615 rue du Jardin Botanique, BP 101, 54602 Villersl`esNancy
, 1996
"... This paper studies three mathematical models of the multiplex PCR method of genome physical mapping described in [12]. The models are expressed as combinatorial group testing problems of finding an unknown Hamiltonian circuit in the complete graph by means of queries of different type. For each mode ..."
Abstract

Cited by 6 (1 self)
 Add to MetaCart
This paper studies three mathematical models of the multiplex PCR method of genome physical mapping described in [12]. The models are expressed as combinatorial group testing problems of finding an unknown Hamiltonian circuit in the complete graph by means of queries of different type. For each
Nearly Tight Bounds on the Number of Hamiltonian Circuits of the Hypercube and Generalizations
"... It has been shown that for every perfect matching M of the ddimensional nvertex hypercube, d> = 2, n = 2d, there exists a second perfect matching M 0 such that the union of M and M 0 forms a Hamiltonian circuit of the ddimensional hypercube. We prove a generalization of a special case of th ..."
Abstract

Cited by 5 (1 self)
 Add to MetaCart
It has been shown that for every perfect matching M of the ddimensional nvertex hypercube, d> = 2, n = 2d, there exists a second perfect matching M 0 such that the union of M and M 0 forms a Hamiltonian circuit of the ddimensional hypercube. We prove a generalization of a special case
Conditions for the existence of Hamiltonian circuits in graphs based on vertex degrees
 J. London Math. Soc
, 1985
"... The terminology used in this paper is that of [7]. The term graph denotes a finite, undirected graph without loops or multiple edges. For any vertex x e V of a graph G = (V, E) let N(x) be the set of vertices adjacent to x, and let d{x) be the degree of x. For any two nonadjacent vertices a and b w ..."
Abstract

Cited by 8 (0 self)
 Add to MetaCart
The terminology used in this paper is that of [7]. The term graph denotes a finite, undirected graph without loops or multiple edges. For any vertex x e V of a graph G = (V, E) let N(x) be the set of vertices adjacent to x, and let d{x) be the degree of x. For any two nonadjacent vertices a and b we associate the vertex set
Exact enumeration of Hamiltonian circuits, walks, and chains in two and three dimensions
, 2007
"... ar ..."
Constructing the Shortest Hamiltonian Circuits and Cycles on a Set of Line Undirected Segments
"... The present paper is devoted to the problem of constructing Hamiltonian cycles on a set of line segments. Given a set of undirected disjoint line segments we build a minimal closed tour including all segments only once. The problem is approached by Ant optimization. ..."
Abstract
 Add to MetaCart
The present paper is devoted to the problem of constructing Hamiltonian cycles on a set of line segments. Given a set of undirected disjoint line segments we build a minimal closed tour including all segments only once. The problem is approached by Ant optimization.
Some Results About Minimum Cuts, Treewidth and Hamiltonian Circuits
, 2004
"... Acknowledgements I thank Dr. Ramesh Hariharan for being my advisor and for giving me the freedom to explore whatever I liked. I thank him for the openness of his outlook. I am greatly indebted to Infosys technologies Ltd. for supporting my research via the Infosys Fellowship. I thank Shankar Ram for ..."
Abstract
 Add to MetaCart
Acknowledgements I thank Dr. Ramesh Hariharan for being my advisor and for giving me the freedom to explore whatever I liked. I thank him for the openness of his outlook. I am greatly indebted to Infosys technologies Ltd. for supporting my research via the Infosys Fellowship. I thank Shankar Ram for being a close friend and companion. He was a great help in surviving the struggle of Ph.D, which involved slowly carving out a new philosophy of existence for oneself from the disheartening mist of disillusionment. I am greatly indebted to my family: My parents and my sisters. If I hadn't taken this path, I could probably have given them much more. But they have never complained... I am thankful to C.R.S and Nari for sharing their ideas with me and for being nice friends and for helping me in many ways.
Results 11  20
of
232