Abstract
Graph embedding has been known as a powerful tool for implementation of parallel algorithms or simulation of different interconnection networks. Congestion is one of the main optimization objectives in global routing. In this paper, we introduce a technique to obtain a tight bound for congestion of an embedding. Moreover, we give algorithms to compute exact congestion of embedding the hypercubes into the cylinder and the torus and prove that the bound obtained is sharp.
Author supplied keywords
Cite
CITATION STYLE
Manuel, P., Rajasingh, I., Rajan, R. S., Parthiban, N., & Rajalaxmi, T. M. (2015). A tight bound for congestion of an embedding. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 8959, pp. 229–237). Springer Verlag. https://doi.org/10.1007/978-3-319-14974-5_22
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
