Embeddings of binary trees in lines

DOI10.1016/0304-3975(85)90050-7zbMath0565.68060OpenAlexW1995744895MaRDI QIDQ1058856

Krzysztof Diks

Publication date: 1985

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0304-3975(85)90050-7

zbMATH Keywords

graph embeddingdilation cost

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10)

Related Items (1)

Combinatorial theorems about embedding trees on the real line

Cites Work

• On the computational power of pushdown automata
• Complexity Results for Bandwidth Minimization
• Bounds on the costs of data encodings
• Unnamed Item

This page was built for publication: Embeddings of binary trees in lines