Characterization of the congestion lemma on layout computation
Summary: An embedding of a guest network \(GN\) into a host network \(HN\) is to find a suitable bijective function between the vertices of the guest and the host such that each link of \(GN\) is stretched to a path in \(HN\). The layout measure is attained by counting the length of paths in \(HN\) corresponding to the links in \(GN\) and with a complexity of finding the best possible function overall graph embedding. This measure can be computed by summing the minimum congestions on each link of \(HN\), called the congestion lemma. In the current study, we discuss and characterize the congestion lemma by considering the regularity and optimality of the guest network. The exact values of the layout are generally hard to find and were known for very restricted combinations of guest and host networks. In this series, we derive the correct layout measures of circulant networks by embedding them into the path- and cycle-of-complete graphs.
- 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ⁿ)
- 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
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)
