Bothway embedding of circulant network into grid
DOI10.1016/J.JDA.2015.01.001zbMATH Open1337.68212OpenAlexW2053671178MaRDI QIDQ491606FDOQ491606
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
Recommendations
Graph algorithms (graph-theoretic aspects) (05C85) Graph theory (including graph drawing) in computer science (68R10) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Embedding meshes into locally twisted cubes
- Reliable circulant networks with minimum transmission delay
- Title not available (Why is that?)
- New binary coding results by circulants
- Exact wirelength of hypercubes on a grid
- 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
- A survey of solved problems and applications on bandwidth, edgesum, and profile of graphs
- Embedding of cycles and wheels into arbitrary trees
- Minimum average congestion of enhanced and augmented hypercubes into complete binary trees
- The cyclic cutwidth of trees
- Embeddings of circulant networks
- Efficient embeddings of grids into grids
- Optimal embeddings of generalized ladders into hypercubes
- Embedding of tori and grids into twisted cubes
- Embedding meshes/tori in faulty crossed cubes
- On Hamiltonian circuits and spanning trees of hypercubes
- Embedding hypercubes into cylinders, snakes and caterpillars for minimizing wirelength
- Efficient embeddings of ternary trees into hypercubes.
- Optimal distance networks of low degree for parallel computers
- Embedding meshes into crossed cubes
- Dense sets and embedding binary trees into hypercubes
- Embedding of hypercubes into necklace, windmill and snake graphs
- Embedding of special classes of circulant networks, hypercubes and generalized Petersen graphs
- Embedding of meshes in Möbius cubes
- Embedding some hierarchical caterpillars into hypercube
- Title not available (Why is that?)
- On embedding rectangular grids in hypercubes
Cited In (9)
- Embedding circulant networks into butterfly and benes networks
- Exact wirelength of circulant networks into cycle-of-ladders.
- Optimal embedding of locally twisted cubes into grids
- Embedding circulant and grid based network
- Embeddings of circulant networks
- 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
- Title not available (Why is that?)
- Improved bound for dilation of an embedding onto circulant networks
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)