Embedding of \(k\)-ary complete trees into hypercubes with uniform load

DOI10.1006/JPDC.1998.1464zbMath0911.68078OpenAlexW2073470573MaRDI QIDQ1273899

Jan Trdlička, Pavel Tvrdík

Publication date: 19 April 1999

Published in: Journal of Parallel and Distributed Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1006/jpdc.1998.1464

zbMATH Keywords

embeddingoptimal hypercubes

Mathematics Subject Classification ID

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

Related Items (1)

Embedding certain height-balanced trees and complete \(p^m\)-ary trees into hypercubes

This page was built for publication: Embedding of \(k\)-ary complete trees into hypercubes with uniform load