Optimal embedding of complete binary trees into lines and grids

DOI10.1006/JPDC.1998.1424zbMath0983.68148OpenAlexW2060208019MaRDI 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

zbMATH Keywords

graph embedding problems

Mathematics Subject Classification ID

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

Related Items (5)

Unnamed Item ⋮ Cubicity and bandwidth ⋮ Optimal distortion embedding of complete binary trees into lines ⋮ Combinatorial theorems about embedding trees on the real line ⋮ Distortion lower bounds for line embeddings

This page was built for publication: Optimal embedding of complete binary trees into lines and grids