Embedding complete \(k\)-ary trees into \(k\)-square 2-D meshes with optimal edge congestion

DOI10.1016/S0167-8191(00)00009-0zbMath0945.68009OpenAlexW2057612726MaRDI QIDQ1575316

Jan Trdlička, Pavel Tvrdík

Publication date: 21 August 2000

Published in: Parallel Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0167-8191(00)00009-0

zbMATH Keywords

expansionembedding problemcomplete treeload2-D meshdivide \& conquer computationedge congestion

Mathematics Subject Classification ID

Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)

Related Items (1)

Separator-based graph embedding into multidimensional grids with small edge-congestion

This page was built for publication: Embedding complete \(k\)-ary trees into \(k\)-square 2-D meshes with optimal edge congestion