How to fit a tree in a box

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

*Corresponding author for this work

Research output: Chapter in Book/Report/Conference proceedingConference contribution

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 publication Proceedings of the 26th International Symposium on Graph Drawing and Network Visualization (GD 2018)
PublisherSpringer, Cham
Pages361-367
Number of pages7
ISBN (Print)9783030044138
DOIs
Publication statusPublished - 2018
Event26th International Symposium on Graph Drawing and Network Visualization, GD 2018 - Barcelona, Spain
Duration: 26 Sep 201828 Sep 2018

Publication series

NameLNCS
Volume11282
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

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computer Science(all)

Fingerprint Dive into the research topics of 'How to fit a tree in a box'. Together they form a unique fingerprint.

  • Cite this

    Akitaya, H. A., Löffler, M., & Parada, I. (2018). How to fit a tree in a box. In Proceedings of the 26th International Symposium on Graph Drawing and Network Visualization (GD 2018) (pp. 361-367). (LNCS; Vol. 11282). Springer, Cham. https://doi.org/10.1007/978-3-030-04414-5_26