Optimal embedding of complete binary trees into lines and grids
From MaRDI portal
Publication:1130317
DOI10.1006/jpdc.1998.1424zbMath0983.68148MaRDI QIDQ1130317
Walter Unger, Ralf Heckmann, Ralf Klasing, Burkhard Monien
Publication date: 20 August 1998
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.1424
68R10: Graph theory (including graph drawing) in computer science
Related Items
Optimal distortion embedding of complete binary trees into lines, Distortion lower bounds for line embeddings, Cubicity and bandwidth, Combinatorial theorems about embedding trees on the real line, Unnamed Item