Efficient Embeddings into Hypercube-like Topologies

  title={Efficient Embeddings into Hypercube-like Topologies},
  author={Volker Heun and Ernst W. Mayr},
  journal={Comput. J.},
Embeddings of various graph classes into hypercubes have been widely studied. Almost all these classes are regularly structured graphs such as meshes, complete trees or pyramids. In this paper, we present a general method for one-to-one embeddings of irregularly structured graphs into their optimal hypercubes, based on extended edge bisectors of graphs. An extended edge bisector is an edge bisector with the additional property that a certain subset of the vertices is distributed more or less… 

Figures from this paper

Bounding Dilation and Edge-Congestion of Separator-Based Graph Embeddings into Grids

  • Akira Matsubayashi
  • Computer Science
    2015 Third International Symposium on Computing and Networking (CANDAR)
  • 2015
It is proved that any graph with N nodes, maximum node degree Δ ≥ 2, and with a node-separator of size s, can be embedded with a dilation of O(N<sup>1/d</sup> log Δ / ϵ log N) and an edge-congestion of O (Δ) for any 1/log N ≤ ϵ <; 1 - α.

Separator-based graph embedding into higher-dimensional grids with small congestion

  • Akira Matsubayashi
  • Computer Science
    2009 IEEE International Symposium on Circuits and Systems
  • 2009
It is proved that any guest graph can be embedded with a smaller edge-congestion as the guest graph has a smaller separator, and as the host grid has a higher dimension.

Separator-based graph embedding into multidimensional grids with small edge-congestion

The bipanconnectivity and m-panconnectivity of the folded hypercube

  • Jywe-Fei Fang
  • Mathematics, Computer Science
    Theor. Comput. Sci.
  • 2007

Embedding Hamiltonian Cycles in the Extended OTIS-n-Cube Topology

This paper introduces theoretical and practical study on embedding Hamiltonian cycle in the Extended OTIS-n-Cube and presents a generalized Algorithm, capable to form a Hamiltonian cycles starting from any node in the network.

Hamiltonian cycle within extended OTIS-cube topology

This paper proposes an algorithm to form a Hamiltonian cycle in the extended OTIS-n-Cube Interconnection network and presents examples in different network sizes to show how Hamiltonian cycles are constructed.

Interlacing Bypass Rings to Torus Networks for More Efficient Networks

It is found that interlacing rings of sizes 6 and 12 to all three dimensions of a torus network with meshes 30 × 30 × 36 generate the best network of all possible networks, including 4D torus and hypercube of approximately 32,000 nodes.

Broadcasting and Routing Algorithms for the Extended OTIS-Cube Network

A routing algorithm for the Extended OTIS-n-Cube Networks is introduced, which has many good topological features such as regular degree, semantic structure, low diameter, and ability to embed graphs and cycles.



How to Embed Trees in Hypercubes.

This paper provides a novel and optimal embedding of a complete binary tree in which all but one tree edges are mapped onto adjacent processors on the hypercube, and the remaining edge is routed through an unused processor.

On the Complexity of the Embedding Problem for Hypercube Related Graphs

Embedding Graphs with Bounded Treewidth into Their Optimal Hypercubes

This is the first time that embeddings of graphs with a highly irregular structure into hypercubes are investigated and the presented embedding achieves dilation of at most 3?log((d+1)(t+1))?+8 and node-congestion of at least O(d(dt)3), where t denotes the treewidth of the graph.

Optimal Dynamic Embeddings of Complete Binary Trees into Hypercubes

This paper presents simple dynamic embeddings of double-rooted complete binary trees into hypercubes which do not suffer from this disadvantage and also presents edge-disjointembeddings with optimal load and unit dilation.

Efficient Dynamic Embeddings of Binary Trees into Hypercubes

A deterministic algorithm for dynamically embedding binary trees into hypercubes using migration of previously mapped tree vertices constructs a dynamic embedding which achieves dilation of at most 9, unit load, nearly optimal expansion, and constant edge- and node-congestion simultaneously.

Optimal Dynamic Edge-Disjoint Embeddings of Complete Binary Trees into Hypercubes

This paper presents simple dynamic embeddings of double-rooted complete binary trees and, therefore, of completebinary trees into hypercubes which do not suffer from this disadvantage and gives an edge-disjoint embedding with optimal load 2 and unit dilation such that each hypercube vertex is an image of at most one vertex of a level.

Embedding of Grids into Optimal Hypercubes

  • M. Chan
  • Computer Science
    SIAM J. Comput.
  • 1991
This paper addresses the following graph-embedding question: given a grid and the smallest hypercube with at least as many nodes as the grid has grid points, how can grid points be assigned to

Efficient Embeddings of Trees in Hypercubes

It is shown that EVERY BOUNDED-DEGREE TREE can be SIMULATED on the HYPERCUBE with CONSTANT COMMUNICATIONS overhead, and not all Bounded-Degree GRAPHS can be EFFICIENTLY EMBEDDED within the HYperCUBe.

Efficient Dynamic Embedding of Arbitrary Binary Trees into Hypercubes

The algorithm presented here uses migration of previously mapped tree vertices and achieves dilation 9, unit load, expansion <4 and constant node-congestion and the embedding can be computed on the hypercube.

Embedding Trees in a Hypercube is NP-Complete

It is shown that the problem of determining for a given tree T and integer k if T is a partial subgraph of a k-dimensional cube is NP-complete.