Recommendations
- Exact wirelength of circulant networks into cycle-of-ladders.
- Exact wirelength of embedding circulant networks into necklace and windmill graphs.
- Embedding circulant and grid based network
- Bothway embedding of circulant network into grid
- Embedding circulant networks into butterfly and benes networks
Cites work
- 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?)
- A framework for solving VLSI graph layout problems
- A survey of solved problems and applications on bandwidth, edgesum, and profile of graphs
- An edge-isoperimetric problem for powers of the Petersen graph
- Crossing Numbers and Cutwidths
- Edge-isoperimetric problems for Cartesian powers of regular graphs
- Efficient embeddings of grids into grids
- Embedding complete trees into the hypercube
- Embedding meshes into locally twisted cubes
- Embedding meshes/tori in faulty crossed cubes
- Embedding of cycles and wheels into arbitrary trees
- Embedding of cycles in twisted cubes with edge-pancyclic
- Embedding of tori and grids into twisted cubes
- Embeddings of complete binary trees into grids and extended grids with total vertex-congestion 1
- Exact wirelength of hypercubes on a grid
- Introduction to algorithms
- On embeddings of snarks in the torus
- Optimal embeddings of generalized ladders into hypercubes
- Path embedding in star graphs
- The congestion of \(n\)-cube layout on a rectangular grid
- The cyclic cutwidth of trees
- Topology of series-parallel networks
Cited in
(20)- On linear layout of bicube and construction of optimal incomplete bicube
- Node set optimization problem for complete Josephus cubes
- Network Comparison: Embeddings and Interiors
- Survey on path and cycle embedding in some networks
- Exact wirelength of embedding circulant networks into necklace and windmill graphs.
- Embedding of hypercubes into necklace, windmill and snake graphs
- A note on minimum linear arrangement for BC graphs
- The embedding of rings and meshes into \(\text{RP} (k)\) networks
- Maximum incomplete recursive circulants in graph embeddings
- Exact wirelength of circulant networks into cycle-of-ladders.
- Embedding of recursive circulant \(RC(2^{n},4)\) into circular necklace
- Layout of random circulant graphs
- Characterization of the congestion lemma on layout computation
- Inducing Measures by Cyclic Networks
- Minimum layout of circulant graphs into certain height balanced trees
- Bothway embedding of circulant network into grid
- Embedding of hypercubes into sibling trees
- Embedding circulant and grid based network
- Embedding of recursive circulants into certain necklace graphs
- Embedding hypercubes and folded hypercubes onto Cartesian product of certain trees
This page was built for publication: Embeddings of circulant networks
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q358657)
