On embeddings in cycles

DOI10.1006/INCO.1995.1068zbMATH Open0826.68012OpenAlexW2086177563MaRDI QIDQ1892891FDOQ1892891

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

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

Recommendations

• Embedding complete binary trees into star networks
• Improved bound for dilation of an embedding onto circulant networks
• Embedding circulant networks into butterfly and benes networks
• scientific article; zbMATH DE number 139790

zbMATH Keywords

complete treeshyper-cubesparallel computer interconnection networks

Mathematics Subject Classification ID

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

Cited In (8)

• Embedding circulant networks into butterfly and benes networks
• A general variable neighborhood search for the cyclic antibandwidth problem
• The Cyclic Antibandwidth Problem
• 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
• Title not available (Why is that?)
• Improved bound for dilation of an embedding onto circulant networks

This page was built for publication: On embeddings in cycles

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