Bothway embedding of circulant network into grid

DOI10.1016/J.JDA.2015.01.001MaRDI QIDQ491606zbMATH OpenOpenAlexFDO

Authors Indra Rajasingh, R. Sundara Rajan, N. Parthiban, T. M. Rajalaxmi

Publication date 18 August 2015

Published in Journal of Discrete Algorithms (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.jda.2015.01.001

zbMATH Keywords

circulant networkembeddinggridwirelength

Mathematics Subject Classification ID

Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60) Graph algorithms (graph-theoretic aspects) (05C85) Graph theory (including graph drawing) in computer science (68R10)

Recommendations

• Embedding circulant and grid based network
• Embedding circulant networks into butterfly and benes networks
• Exact wirelength of circulant networks into cycle-of-ladders.
• Embeddings of circulant networks
• Exact wirelength of embedding circulant networks into necklace and windmill graphs.

Cites work

• A survey of solved problems and applications on bandwidth, edgesum, and profile of graphs
• An edge-isoperimetric problem for powers of the Petersen graph
• Dense sets and embedding binary trees into hypercubes
• Efficient embeddings of grids into grids
• Efficient embeddings of ternary trees into hypercubes.
• Embedding hypercubes into cylinders, snakes and caterpillars for minimizing wirelength
• Embedding meshes into crossed cubes
• Embedding meshes into locally twisted cubes
• Embedding meshes/tori in faulty crossed cubes
• Embedding of cycles and wheels into arbitrary trees
• Embedding of hypercubes into necklace, windmill and snake graphs
• Embedding of meshes in Möbius cubes
• Embedding of special classes of circulant networks, hypercubes and generalized Petersen graphs
• Embedding of tori and grids into twisted cubes
• Embedding some hierarchical caterpillars into hypercube
• Embeddings of circulant networks
• Embeddings of complete binary trees into grids and extended grids with total vertex-congestion 1
• Exact wirelength of hypercubes on a grid
• scientific article; zbMATH DE number 4064517 (Why is no real title available?)
• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• scientific article; zbMATH DE number 2010366 (Why is no real title available?)
• scientific article; zbMATH DE number 2060183 (Why is no real title available?)
• Minimum average congestion of enhanced and augmented hypercubes into complete binary trees
• New binary coding results by circulants
• On embedding rectangular grids in hypercubes
• On Hamiltonian circuits and spanning trees of hypercubes
• Optimal distance networks of low degree for parallel computers
• Optimal embeddings of generalized ladders into hypercubes
• Reliable circulant networks with minimum transmission delay
• The congestion of \(n\)-cube layout on a rectangular grid
• The cyclic cutwidth of trees

Cited in

(9)

• Embedding algorithm of spined cube into grid structure and its wirelength computation
• A linear time algorithm for embedding locally twisted cube into grid network to optimize the layout
• Embedding circulant networks into butterfly and benes networks
• Optimal embedding of locally twisted cubes into grids
• Improved bound for dilation of an embedding onto circulant networks
• Embedding circulant and grid based network
• Embeddings of circulant networks
• scientific article; zbMATH DE number 1538536 (Why is no real title available?)
• Exact wirelength of circulant networks into cycle-of-ladders.

This page was built for publication: Bothway embedding of circulant network into grid

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