Characterization of the congestion lemma on layout computation

DOI10.1155/2021/2984703zbMath1477.68240OpenAlexW3210345926WikidataQ124963476 ScholiaQ124963476MaRDI QIDQ2051622

Micheal Arockiaraj, Arul Jeya Shalini, Jia-Bao Liu, 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

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10)

Related Items (1)

Optimal embedding of hypercube into cylinder

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Embeddings of circulant networks
• Embedding of hypercubes into necklace, windmill and snake graphs
• 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
• Embedding of hypercubes into sibling trees
• A survey of solved problems and applications on bandwidth, edgesum, and profile of graphs
• Optimal Wirelength of Balanced Complete Multipartite Graphs onto Cartesian Product of {Path, Cycle} and Trees
• Optimal Assignments of Numbers to Vertices

This page was built for publication: Characterization of the congestion lemma on layout computation