Lattice embeddings of trees

4Citations
Citations of this article
7Readers
Mendeley users who have this article in their library.

Abstract

This note presents a linear algorithm that isometrically embeds a given tree T into an integer lattice of minimal dimension and allows one to compute the lattice coordinates of every single vertex of T in optimal time. © 2008 Elsevier Ltd. All rights reserved.

Cite

CITATION STYLE

APA

Imrich, W., & Kovše, M. (2009). Lattice embeddings of trees. European Journal of Combinatorics, 30(5), 1142–1148. https://doi.org/10.1016/j.ejc.2008.09.016

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free