Cycle decompositions III: Complete graphs and fixed length cycles

2001 ◽  
Vol 10 (1) ◽  
pp. 27-78 ◽  
Author(s):  
Mateja ?ajna
Keyword(s):  
Complete Graphs ◽  
Fixed Length ◽  
Cycle Decompositions

scholarly journals On Hamilton cycle decompositions of the tensor product of complete graphs

2003 ◽  
Vol 268 (1-3) ◽  
pp. 49-58 ◽  
Author(s):  
R. Balakrishnan ◽  
J.-C. Bermond ◽  
P. Paulraja ◽  
M.-L. Yu
Keyword(s):  
Tensor Product ◽  
Hamilton Cycle ◽  
Complete Graphs ◽  
Cycle Decompositions

Even cycle decompositions of complete graphs minus a 1-factor

1994 ◽  
Vol 2 (6) ◽  
pp. 441-458 ◽  
Author(s):  
Brian Alspach ◽  
Susan Marshall
Keyword(s):  
Complete Graphs ◽  
Cycle Decompositions

scholarly journals Cycle decompositions V: Complete graphs into cycles of arbitrary lengths

2013 ◽  
Vol 108 (5) ◽  
pp. 1153-1192 ◽  
Author(s):  
Darryn Bryant ◽  
Daniel Horsley ◽  
William Pettersson
Keyword(s):  
Complete Graphs ◽  
Cycle Decompositions

scholarly journals Cycle decompositions IV: complete directed graphs and fixed length directed cycles

2003 ◽  
Vol 103 (1) ◽  
pp. 165-208 ◽  
Author(s):  
Brian Alspach ◽  
Heather Gavlas ◽  
Mateja Šajna ◽  
Helen Verrall
Keyword(s):  
Directed Graphs ◽  
Fixed Length ◽  
Directed Cycles ◽  
Cycle Decompositions

scholarly journals Cycle decompositions of complete graphs

1982 ◽  
Vol 38 (2-3) ◽  
pp. 143-156 ◽  
Author(s):  
E.J. Farrell
Keyword(s):  
Complete Graphs ◽  
Cycle Decompositions

scholarly journals Symmetric Hamilton cycle decompositions of complete graphs minus a 1-factor

2010 ◽  
Vol 19 (1) ◽  
pp. 1-15 ◽  
Author(s):  
Richard A. Brualdi ◽  
Michael W. Schroeder
Keyword(s):  
Hamilton Cycle ◽  
Complete Graphs ◽  
Cycle Decompositions

scholarly journals Resolvable even cycle decompositions of the tensor product of complete graphs

2011 ◽  
Vol 311 (16) ◽  
pp. 1841-1850 ◽  
Author(s):  
P. Paulraja ◽  
S. Sampath Kumar
Keyword(s):  
Tensor Product ◽  
Complete Graphs ◽  
Cycle Decompositions

A Fixed Field/Fixed Length Automated Case Record Using an IBM 1232 Optically Readable Document

1968 ◽  
Vol 07 (03) ◽  
pp. 156-158
Author(s):  
Th. R. Taylor
Keyword(s):  
Clinical Data ◽  
Case Record ◽  
Fixed Field ◽  
Fixed Length

The technique, scope and limitations of a fixed field/fixed length case record utilising the IBM 1232 system is described. The principal problems lie with personnel rather than machinery and with programmes for analysis rather than clinical data.

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.

Sign in / Sign up

Export Citation Format

Share Document