How to fit a tree in a box

Hugo A. Akitaya, Maarten Löffler, Irene Parada

Research output: Chapter in Book/Report/Conference proceedingConference contributionResearchpeer-review

Abstract

We study compact straight-line embeddings of trees. We show that perfect binary trees can be embedded optimally: a tree with n nodes can be drawn on a √n by √n grid. We also show that testing whether a given binary tree has an upward embedding with a given combinatorial embedding in a given grid is NP-hard.

Original languageEnglish
Title of host publicationGraph Drawing and Network Visualization - 26th International Symposium, GD 2018, Proceedings
PublisherSpringer Verlag Heidelberg
Pages361-367
Number of pages7
ISBN (Print)9783030044138
DOIs
Publication statusPublished - 1 Jan 2018
Event26th International Symposium on Graph Drawing and Network Visualization, GD 2018 - Barcelona, Spain
Duration: 26 Sep 201828 Sep 2018

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume11282 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Conference

Conference26th International Symposium on Graph Drawing and Network Visualization, GD 2018
CountrySpain
CityBarcelona
Period26/09/1828/09/18

Fingerprint

Binary trees
Binary Tree
Grid
Straight Line
NP-complete problem
Testing
Vertex of a graph

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computer Science(all)

Cite this

Akitaya, H. A., Löffler, M., & Parada, I. (2018). How to fit a tree in a box. In Graph Drawing and Network Visualization - 26th International Symposium, GD 2018, Proceedings (pp. 361-367). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 11282 LNCS). Springer Verlag Heidelberg. https://doi.org/10.1007/978-3-030-04414-5_26

How to fit a tree in a box. / Akitaya, Hugo A.; Löffler, Maarten; Parada, Irene.

Graph Drawing and Network Visualization - 26th International Symposium, GD 2018, Proceedings. Springer Verlag Heidelberg, 2018. p. 361-367 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 11282 LNCS).

Research output: Chapter in Book/Report/Conference proceedingConference contributionResearchpeer-review

Akitaya, HA, Löffler, M & Parada, I 2018, How to fit a tree in a box. in Graph Drawing and Network Visualization - 26th International Symposium, GD 2018, Proceedings. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 11282 LNCS, Springer Verlag Heidelberg, pp. 361-367, 26th International Symposium on Graph Drawing and Network Visualization, GD 2018, Barcelona, Spain, 26/09/18. https://doi.org/10.1007/978-3-030-04414-5_26
Akitaya HA, Löffler M, Parada I. How to fit a tree in a box. In Graph Drawing and Network Visualization - 26th International Symposium, GD 2018, Proceedings. Springer Verlag Heidelberg. 2018. p. 361-367. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). https://doi.org/10.1007/978-3-030-04414-5_26
Akitaya, Hugo A. ; Löffler, Maarten ; Parada, Irene. / How to fit a tree in a box. Graph Drawing and Network Visualization - 26th International Symposium, GD 2018, Proceedings. Springer Verlag Heidelberg, 2018. pp. 361-367 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).
@inproceedings{f1cf4d1282b34ca2b0eccb1bdeff6633,
title = "How to fit a tree in a box",
abstract = "We study compact straight-line embeddings of trees. We show that perfect binary trees can be embedded optimally: a tree with n nodes can be drawn on a √n by √n grid. We also show that testing whether a given binary tree has an upward embedding with a given combinatorial embedding in a given grid is NP-hard.",
author = "Akitaya, {Hugo A.} and Maarten L{\"o}ffler and Irene Parada",
year = "2018",
month = "1",
day = "1",
doi = "10.1007/978-3-030-04414-5_26",
language = "English",
isbn = "9783030044138",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
publisher = "Springer Verlag Heidelberg",
pages = "361--367",
booktitle = "Graph Drawing and Network Visualization - 26th International Symposium, GD 2018, Proceedings",

}

TY - GEN

T1 - How to fit a tree in a box

AU - Akitaya, Hugo A.

AU - Löffler, Maarten

AU - Parada, Irene

PY - 2018/1/1

Y1 - 2018/1/1

N2 - We study compact straight-line embeddings of trees. We show that perfect binary trees can be embedded optimally: a tree with n nodes can be drawn on a √n by √n grid. We also show that testing whether a given binary tree has an upward embedding with a given combinatorial embedding in a given grid is NP-hard.

AB - We study compact straight-line embeddings of trees. We show that perfect binary trees can be embedded optimally: a tree with n nodes can be drawn on a √n by √n grid. We also show that testing whether a given binary tree has an upward embedding with a given combinatorial embedding in a given grid is NP-hard.

UR - http://www.scopus.com/inward/record.url?scp=85059101441&partnerID=8YFLogxK

U2 - 10.1007/978-3-030-04414-5_26

DO - 10.1007/978-3-030-04414-5_26

M3 - Conference contribution

SN - 9783030044138

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 361

EP - 367

BT - Graph Drawing and Network Visualization - 26th International Symposium, GD 2018, Proceedings

PB - Springer Verlag Heidelberg

ER -