Efficient Embeddings into Hypercube-like Topologies

DOI10.1093/COMJNL/46.6.632MaRDI QIDQ4811512zbMATH OpenOpenAlexFDO

Authors Volker Heun, Ernst W. Mayr

Publication date 6 September 2004

Published in The Computer Journal (Search for Journal in Brave)

Full work available at URL https://semanticscholar.org/paper/3a9a39b3c7a6295253fdaebfd22d2ee972c25848

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Graph theory (including graph drawing) in computer science (68R10)

Recommendations

• Optimal embeddings of butterfly-like graphs in the hypercube
• Embedding graphs with bounded treewidth into optimal hypercubes
• scientific article; zbMATH DE number 1769334
• Efficient Embeddings of Trees in Hypercubes
• Hypercube emulation of interconnection networks topologies

Cited in

(12)

• scientific article; zbMATH DE number 4185639 (Why is no real title available?)
• Hypercube emulation of interconnection networks topologies
• Separator-based graph embedding into multidimensional grids with small edge-congestion
• The bipanconnectivity and \(m\)-panconnectivity of the folded hypercube
• scientific article; zbMATH DE number 70115 (Why is no real title available?)
• Embedding graphs with bounded treewidth into optimal hypercubes
• Optimal embeddings of the exchanged hypercube and the dual-cube as vertex-induced subgraphs of the hypercube
• Efficient proper embedding of a daisy cube
• scientific article; zbMATH DE number 718860 (Why is no real title available?)
• Optimal embedding of hypercube into cylinder
• A note on embeddings among folded hypercubes, even graphs and odd graphs
• Embedding hypercubes, rings, and odd graphs into hyper-stars

This page was built for publication: Efficient Embeddings into Hypercube-like Topologies

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