AI Chat AI Image Generator AI Video Text to Speech

How to Fit a Tree in a Box

08/31/2018

∙

by Hugo A. Akitaya, et al.

∙

∙

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.

Hugo A. Akitaya
21 publications
Maarten Löffler
42 publications
Irene Parada
20 publications

research

∙ 07/01/2020

A novel algorithm to determine the leaf (leaves) of a binary tree from its preorder and postorder traversals

Binary trees are essential structures in Computer Science. The leaf (lea...

0 Peyman Nasehpour, Ph.D., et al. ∙

research

∙ 07/01/2022

Embedding phylogenetic trees in networks of low treewidth

Given a rooted, binary phylogenetic network and a rooted, binary phyloge...

0 Leo van Iersel, et al. ∙

research

∙ 04/25/2023

Phylo2Vec: a vector representation for binary trees

Binary phylogenetic trees inferred from biological data are central to u...

0 Matthew J. Penn, et al. ∙

research

∙ 08/29/2019

Compacted binary trees admit a stretched exponential

A compacted binary tree is a directed acyclic graph encoding a binary tr...

0 Andrew Elvey Price, et al. ∙

research

∙ 06/18/2018

Zip Trees

We introduce the zip tree, a form of randomized binary search tree. One ...

0 Robert E. Tarjan, et al. ∙

research

∙ 02/24/2019

Generation of Tree-Child phylogenetic networks

Phylogenetic networks generalize phylogenetic trees by allowing the mode...

0 Gabriel Cardona, et al. ∙

research

∙ 05/08/2023

Block Crossings in One-Sided Tanglegrams

Tanglegrams are drawings of two rooted binary phylogenetic trees and a m...

0 Alexander Dobler, et al. ∙