Characterization of the congestion lemma on layout computation
From MaRDI portal
Publication:2051622
DOI10.1155/2021/2984703zbMATH Open1477.68240OpenAlexW3210345926WikidataQ124963476 ScholiaQ124963476MaRDI QIDQ2051622FDOQ2051622
Authors: Jiabao Liu, Arul Jeya Shalini, Micheal Arockiaraj, J. Nancy Delaila 
Publication date: 24 November 2021
Published in: Journal of Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1155/2021/2984703
Recommendations
- A linear time algorithm for embedding locally twisted cube into grid network to optimize the layout
- Embedding complete multi-partite graphs into Cartesian product of paths and cycles
- A tight bound for congestion of an embedding
- Minimum layout of circulant graphs into certain height balanced trees
- Congestion optimale du plongement de l’hypercube $H (n)$ dans la chaîne $P(2^n)$
Cites Work
- Title not available (Why is that?)
- Optimal Assignments of Numbers to Vertices
- Title not available (Why is that?)
- A framework for solving VLSI graph layout problems
- 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
- A survey of solved problems and applications on bandwidth, edgesum, and profile of graphs
- Embeddings of circulant networks
- Embedding of hypercubes into necklace, windmill and snake graphs
- Title not available (Why is that?)
- Exact wirelength of embedding circulant networks into necklace and windmill graphs.
- Embedding of hypercubes into sibling trees
- Optimal wirelength of balanced complete multipartite graphs onto Cartesian product of \{path, cycle\} and trees
Cited In (2)
This page was built for publication: Characterization of the congestion lemma on layout computation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2051622)
