Characterization of the congestion lemma on layout computation
From MaRDI portal
Publication:2051622
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ⁿ)
Cites work
- 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
- Embedding of hypercubes into necklace, windmill and snake graphs
- Embedding of hypercubes into sibling trees
- Embeddings of circulant networks
- Embeddings of complete binary trees into grids and extended grids with total vertex-congestion 1
- Exact wirelength of embedding circulant networks into necklace and windmill graphs.
- Exact wirelength of hypercubes on a grid
- scientific article; zbMATH DE number 4064519 (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?)
- Optimal Assignments of Numbers to Vertices
- 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)
