Paper Info
Title
Directed Hamiltonian Packing in d-Dimensional Meshes and Its Application (Extended Abstract)
Abstract
A digraph G with minimum in-degree d and minimum out-degree d is said to have a directed hamiltonian packing if G has d link-disjoint directed hamiltonian cycles. We show that a d-dimensional N1 × × N d mesh, when N i 2d is even, has a directed hamiltonian packing, where an edge (u, v) in G is regarded as two directed links (u, v) and v,u. As its application, we design a time-efficient all-to-all broadcasting algorithm in 3-dimensional meshes under the wormhole routing model.
Year
DOI
Venue
1996
10.1007/BFb0009506
ISAAC
Keywords
Field
DocType
directed hamiltonian packing,d-dimensional meshes,extended abstract,hamiltonian cycle,3 dimensional
Discrete mathematics,Combinatorics,Polygon mesh,Hamiltonian (quantum mechanics),Computer science,Hamiltonian path problem
Conference
ISBN
Citations 
PageRank 
3-540-62048-6
2
0.47
References 
Authors
5
3
Name
Order
Citations
PageRank
Jae-Ha Lee114414.19
Chan-su Shin220626.76
Kyung-Yong Chwa391997.10