Bothway embedding of circulant network into grid
From MaRDI portal
Publication:491606
DOI10.1016/j.jda.2015.01.001zbMath1337.68212OpenAlexW2053671178MaRDI QIDQ491606
N. Parthiban, R. Sundara Rajan, T. M. Rajalaxmi, Indra Rajasingh
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
Graph theory (including graph drawing) in computer science (68R10) Graph algorithms (graph-theoretic aspects) (05C85) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)
Related Items (3)
A linear time algorithm for embedding locally twisted cube into grid network to optimize the layout ⋮ Optimal Embedding of Locally Twisted Cubes into Grids ⋮ Embedding algorithm of spined cube into grid structure and its wirelength computation
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Embeddings of circulant networks
- Embedding hypercubes into cylinders, snakes and caterpillars for minimizing wirelength
- Embedding of hypercubes into necklace, windmill and snake graphs
- Minimum average congestion of enhanced and augmented hypercubes into complete binary trees
- Embedding of tori and grids into twisted cubes
- Embedding meshes/tori in faulty crossed cubes
- Dense sets and embedding binary trees into hypercubes
- Embedding of meshes in Möbius cubes
- Embedding meshes into locally twisted cubes
- Exact wirelength of hypercubes on a grid
- The cyclic cutwidth of trees
- Efficient embeddings of ternary trees into hypercubes.
- An edge-isoperimetric problem for powers of the Petersen graph
- Embeddings of complete binary trees into grids and extended grids with total vertex-congestion 1
- The congestion of \(n\)-cube layout on a rectangular grid
- Embedding meshes into crossed cubes
- On Hamiltonian circuits and spanning trees of hypercubes
- Embedding some hierarchical caterpillars into hypercube
- Reliable circulant networks with minimum transmission delay
- On embedding rectangular grids in hypercubes
- A survey of solved problems and applications on bandwidth, edgesum, and profile of graphs
- Embedding of cycles and wheels into arbitrary trees
- Embedding of special classes of circulant networks, hypercubes and generalized Petersen graphs
- Optimal distance networks of low degree for parallel computers
- New binary coding results by circulants
- Efficient embeddings of grids into grids
- Optimal embeddings of generalized ladders into hypercubes
This page was built for publication: Bothway embedding of circulant network into grid
