scholarly journals A bridge over a Hamiltonian path

2001 ◽  
Vol 23 (3) ◽  
pp. 41-43
Author(s):  
Gary McGuire ◽  
Fiacre Ó Cairbre
Keyword(s):  
Hamiltonian Path

Roulette Wheel Selection based Heuristic Algorithm for the Orienteering Problem

2014 ◽  
Vol 13 (1) ◽  
pp. 4127-4145
Author(s):  
Madhushi Verma ◽  
Mukul Gupta ◽  
Bijeeta Pal ◽  
Prof. K. K. Shukla
Keyword(s):  
Triangle Inequality ◽  
Time Budget ◽  
Control Point ◽  
Hamiltonian Path ◽  
Real Life ◽  
Tourism Industry ◽  
Orienteering Problem ◽  
Complete Graphs ◽  
Roulette Wheel Selection ◽  
Roulette Wheel

Orienteering problem (OP) is an NP-Hard graph problem. The nodes of the graph are associated with scores or rewards and the edges with time delays. The goal is to obtain a Hamiltonian path connecting the two necessary check points, i.e. the source and the target along with a set of control points such that the total collected score is maximized within a specified time limit. OP finds application in several fields like logistics, transportation networks, tourism industry, etc. Most of the existing algorithms for OP can only be applied on complete graphs that satisfy the triangle inequality. Real-life scenario does not guarantee that there exists a direct link between all control point pairs or the triangle inequality is satisfied. To provide a more practical solution, we propose a stochastic greedy algorithm (RWS_OP) that uses the roulette wheel selectionmethod, does not require that the triangle inequality condition is satisfied and is capable of handling both complete as well as incomplete graphs. Based on several experiments on standard benchmark data we show that RWS_OP is faster, more efficient in terms of time budget utilization and achieves a better performance in terms of the total collected score ascompared to a recently reported algorithm for incomplete graphs.

A Parallel Reduction of Hamiltonian Cycle to Hamiltonian Path in Tournaments

1995 ◽  
Vol 19 (3) ◽  
pp. 432-440 ◽  
Author(s):  
E. Bampis ◽  
M. Elhaddad ◽  
Y. Manoussakis ◽  
M. Santha
Keyword(s):  
Hamiltonian Cycle ◽  
Hamiltonian Path ◽  
Parallel Reduction

scholarly journals On the existence of a Hamiltonian path in a graph

1968 ◽  
Vol 13 (6) ◽  
pp. 555-564 ◽  
Author(s):  
Yoshiko Takenaka
Keyword(s):  
Hamiltonian Path

scholarly journals Finite BRST–anti-BRST transformations in generalized Hamiltonian formalism

2014 ◽  
Vol 29 (27) ◽  
pp. 1450159 ◽  
Author(s):  
Pavel Yu. Moshin ◽  
Alexander A. Reshetnyak
Keyword(s):  
Dynamical Systems ◽  
Path Integral ◽  
Hamiltonian Path ◽  
Hamiltonian Formalism ◽  
Lagrangian Formalism ◽  
Yang Mills ◽  
Gauge Dependence ◽  
Field Dependent ◽  
Gauge Fixing ◽  
Constrained Dynamical Systems

We introduce the notion of finite BRST–anti-BRST transformations for constrained dynamical systems in the generalized Hamiltonian formalism, both global and field-dependent, with a doublet λa, a = 1, 2, of anticommuting Grassmann parameters and find explicit Jacobians corresponding to these changes of variables in the path integral. It turns out that the finite transformations are quadratic in their parameters. Exactly as in the case of finite field-dependent BRST–anti-BRST transformations for the Yang–Mills vacuum functional in the Lagrangian formalism examined in our previous paper [arXiv:1405.0790 [hep-th]], special field-dependent BRST–anti-BRST transformations with functionally-dependent parameters λa= ∫ dt(saΛ), generated by a finite even-valued function Λ(t) and by the anticommuting generators saof BRST–anti-BRST transformations, amount to a precise change of the gauge-fixing function for arbitrary constrained dynamical systems. This proves the independence of the vacuum functional under such transformations. We derive a new form of the Ward identities, depending on the parameters λaand study the problem of gauge dependence. We present the form of transformation parameters which generates a change of the gauge in the Hamiltonian path integral, evaluate it explicitly for connecting two arbitrary Rξ-like gauges in the Yang–Mills theory and establish, after integration over momenta, a coincidence with the Lagrangian path integral [arXiv:1405.0790 [hep-th]], which justifies the unitarity of the S-matrix in the Lagrangian approach.

scholarly journals A successful algorithm for the undirected Hamiltonian path problem

1985 ◽  
Vol 10 (2) ◽  
pp. 179-195 ◽  
Author(s):  
Gerald L. Thompson ◽  
Sharad Singhal
Keyword(s):  
Hamiltonian Path ◽  
Hamiltonian Path Problem

Diagnosability and Diagnostic Algorithm for Pancake Graph under the Comparison Model

2015 ◽  
Vol 15 (01n02) ◽  
pp. 1550005
Author(s):  
WENJUN LIU ◽  
CHENG-KUAN LIN
Keyword(s):  
Fault Diagnosis ◽  
Interconnection Networks ◽  
Linear Time ◽  
Hamiltonian Path ◽  
Diagnostic Algorithm ◽  
Efficient Algorithms ◽  
Comparison Model ◽  
Diagnosis Model

Fault diagnosis is important for the reliability of interconnection networks. This paper addresses the fault diagnosis of n-dimensional pancake graph Pn under the comparison diagnosis model. By the concept of local diagnosability, we first prove that the diagnosabitly of Pn is n − 1, and it has strong local diagnosability property even if there are n − 3 faulty edges. Furthermore, we present efficient algorithms to locate extended star and Hamiltonian path structures in Pn, respectively. According to the works of Li et al. and Lai, the extended star and Hamiltonian path structures can be used to identify all faulty vertices in linear time, provided the number of faulty vertices is no more than n − 1.

HAMILTONIAN PROPERTIES OF FAULTY RECURSIVE CIRCULANT GRAPHS

2002 ◽  
Vol 03 (03n04) ◽  
pp. 273-289 ◽  
Author(s):  
CHANG-HSIUNG TSAI ◽  
JIMMY J. M. TAN ◽  
YEN-CHU CHUANG ◽  
LIH-HSING HSU
Keyword(s):  
Bipartite Graph ◽  
Hamiltonian Path ◽  
Circulant Graph ◽  
Circulant Graphs ◽  
Vertex Set ◽  
Regular Node ◽  
Hamiltonian Properties

We present some results concerning hamiltonian properties of recursive circulant graphs in the presence of faulty vertices and/or edges. The recursive circulant graph G(N, d) with d ≥ 2 has vertex set V(G) = {0, 1, …, N - 1} and the edge set E(G) = {(v, w)| ∃ i, 0 ≤ i ≤ ⌈ log d N⌉ - 1, such that v = w + di (mod N)}. When N = cdk where d ≥ 2 and 2 ≤ c ≤ d, G(cdk, d) is regular, node symmetric and can be recursively constructed. G(cdk, d) is a bipartite graph if and only if c is even and d is odd. Let F, the faulty set, be a subset of V(G(cdk, d)) ∪ E(G(cdk, d)). In this paper, we prove that G(cdk, d) - F remains hamiltonian if |F| ≤ deg (G(cdk, d)) - 2 and G(cdk, d) is not bipartite. Moreover, if |F| ≤ deg (G(cdk, d)) - 3 and G(cdk, d) is not a bipartite graph, we prove a more stronger result that for any two vertices u and v in V(G(cdk, d)) - F, there exists a hamiltonian path of G(cdk, d) - F joining u and v.

Sign in / Sign up

Export Citation Format

Share Document