A Minimum Linear Arrangement Algorithm for Undirected Trees
From MaRDI portal
Publication:4182531
DOI10.1137/0208002zbMath0399.05021MaRDI QIDQ4182531
Publication date: 1979
Published in: SIAM Journal on Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/0208002
Related Items
Experiments on the minimum linear arrangement problem, Optimal arrangement of data in a tree directory, Efficient algorithms for single- and two-layer linear placement of parallel graphs, One-dimensional machine location problems in a multi-product flowline with equidistant locations, Two results on linear embeddings of complete binary trees, Parallel algorithms for the minimum cut and the minimum length tree layout problems, On minimum cuts and the linear arrangement problem, Generating lower bounds for the linear arrangement problem