Optimal one-page tree embeddings in linear time
From MaRDI portal
Publication:1014395
DOI10.1016/S0020-0190(03)00261-8zbMath1167.90668OpenAlexW2004589984MaRDI QIDQ1014395
Robert A. Hochberg, Matthias F. M. Stallmann
Publication date: 28 April 2009
Published in: Information Processing Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0020-0190(03)00261-8
Related Items (4)
The maximum linear arrangement problem for trees under projectivity and planarity ⋮ The scaling of the minimum sum of edge lengths in uniformly random trees ⋮ Minimum projective linearizations of trees in linear time ⋮ Bounds of the sum of edge lengths in linear arrangements of trees
Cites Work
- Unnamed Item
- Unnamed Item
- On optimal linear arrangements of trees
- The book thickness of a graph
- An \(0(| E|\log\log| V|)\) algorithm for finding minimum spanning trees
- Some simplified NP-complete graph problems
- On Bipartite Drawings and the Linear Arrangement Problem
- Planar linear arrangements of outerplanar graphs
- A Minimum Linear Arrangement Algorithm for Undirected Trees
This page was built for publication: Optimal one-page tree embeddings in linear time
