Minimum congestion embedding of complete binary trees into tori

DOI10.1007/3-540-48686-0_37MaRDI QIDQ4938676zbMATH OpenFDO

Authors Akira Matsubayashi, Ryo Takasu

Publication date 23 February 2000

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/3-540-48686-0_37

zbMATH Keywords

binary treesembeddingtori

Mathematics Subject Classification ID

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

Recommendations

• Embeddings of complete binary trees into grids and extended grids with total vertex-congestion 1
• Optimal embedding of complete binary trees into lines and grids
• scientific article; zbMATH DE number 1769334
• On the complexity of tree embedding problems
• scientific article; zbMATH DE number 1103048

Cited in

(5)

• Embeddings of complete binary trees into grids and extended grids with total vertex-congestion 1
• Optimal two-sided embeddings of complete binary trees in rectangular grids
• scientific article; zbMATH DE number 1769334 (Why is no real title available?)
• A tight bound for congestion of an embedding
• Minimum average congestion of enhanced and augmented hypercubes into complete binary trees

This page was built for publication: Minimum congestion embedding of complete binary trees into tori

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4938676)