On embeddings in cycles

DOI10.1006/inco.1995.1068zbMath0826.68012OpenAlexW2086177563MaRDI QIDQ1892891

Ondrej Sýkora, Imrich Vrt'o, Vladimír Müller, Juraj Hromkovič

Publication date: 10 July 1995

Published in: Information and Computation (Search for Journal in Brave)

Full work available at URL: https://semanticscholar.org/paper/694b66fe688d7715b5977bff53c9091aca414d0f

zbMATH Keywords

complete treeshyper-cubesparallel computer interconnection networks

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10)

Related Items (5)

Cyclic cutwidths of the two-dimensional ordinary and cylindrical meshes ⋮ Congestion optimale du plongement de l’hypercube $H (n)$ dans la chaîne $P(2^n)$ ⋮ Antibandwidth and cyclic antibandwidth of meshes and hypercubes ⋮ The Cyclic Antibandwidth Problem ⋮ A general variable neighborhood search for the cyclic antibandwidth problem

This page was built for publication: On embeddings in cycles