Directed hamiltonian packing in d-dimensional meshes and its application

DOI10.1007/BFB0009506MaRDI QIDQ6487449zbMATH OpenFDO

Authors Jae-Ha Lee, Chan-Su Shin, Kyung-Yong Chwa

Publication date 25 January 2023

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Eulerian and Hamiltonian graphs (05C45) Hardware implementations of nonnumerical algorithms (VLSI algorithms, etc.) (68W35)

Recommendations

• Optimal embedding of multiple directed Hamiltonian rings into d-dimensional meshes
• An efficient algorithm for constructing Hamiltonian paths in meshes
• Hamilton circuits in the directed wrapped Butterfly network
• Packing, counting and covering Hamilton cycles in random directed graphs
• An Efficient Parallel Algorithm for Finding Hamiltonian Cycles in Dense Directed Graphs

Cites work

• scientific article; zbMATH DE number 47528 (Why is no real title available?)
• Hamilton decompositions of Cartesian products of graphs
• Optimum broadcasting and personalized communication in hypercubes

Cited in

(1)

• Optimal embedding of multiple directed Hamiltonian rings into d-dimensional meshes

This page was built for publication: Directed hamiltonian packing in d-dimensional meshes and its application

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6487449)