An efficient algorithm for constructing Hamiltonian paths in meshes

Parallel Computing

Volumn 28, Issue 9, 2002, Pages 1293-1305

  Dong Chen, Shao ^a   Shen, Hong ^b   Topor, Rodney ^c  

^a Hutchison Telecommunications Ltd   (Hong Kong)

^b JAPAN ADVANCED INSTITUTE OF SCIENCE AND TECHNOLOGY   (Japan)

^c GRIFFITH UNIVERSITY   (Australia)

Author keywords

Hamiltonian paths; Meshes; Performance evaluation; Sequential and parallel algorithms

Indexed keywords

HAMILTONIANS; PARALLEL ALGORITHMS; PROBLEM SOLVING; PROGRAM PROCESSORS;

INTER-PROCESSOR COMMUNICATIONS;

PARALLEL PROCESSING SYSTEMS;

EID: 0036730406     PISSN: 01678191     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0167-8191(02)00135-7     Document Type: Article

References (8)

1. The hamilton circuit problem on grids
2. Efficient parallel permutation-based range-join algorithms on mesh-connected computers
3. Permutation-based range-join algorithms on N-dimensional meshes
4. Hamilton paths in grid graphs
5. Optimal total exchange for a 3-d torus of processors
6. On the capacity of multihop slottee ALOHA networks with regular structure