A Minimum Linear Arrangement Algorithm for Undirected Trees

From MaRDI portal
Publication:4182531

DOI10.1137/0208002zbMath0399.05021OpenAlexW2012951995MaRDI QIDQ4182531

Yossi Shiloach

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

A Correction on Shiloach's Algorithm for Minimum Linear Arrangement of Trees, Generating lower bounds for the linear arrangement problem, Two results on linear embeddings of complete binary trees, Minimum Linear Arrangement of the Cartesian Product of Optimal Order Graph and Path, Efficient algorithms for single- and two-layer linear placement of parallel graphs, Graph layout problems, On bipartite crossings, largest biplanar subgraphs, and the linear arrangement problem, Parallel algorithms for the minimum cut and the minimum length tree layout problems, The maximum linear arrangement problem for trees under projectivity and planarity, Efficient parallel algorithms for some tree layout problems, Linear arrangement problems on recursively partitioned graphs, A variation on the min cut linear arrangement problem, The scaling of the minimum sum of edge lengths in uniformly random trees, Heuristics for the data arrangement problem on regular trees, Unnamed Item, Optimal arrangement of data in a tree directory, A mixed 0-1 linear programming formulation for the exact solution of the minimum linear arrangement problem, An intermediate-value theorem for optimum tree valuation, Experiments on the minimum linear arrangement problem, Unnamed Item, Optimal one-page tree embeddings in linear time, Minimum projective linearizations of trees in linear time, On minimum cuts and the linear arrangement problem, One-dimensional machine location problems in a multi-product flowline with equidistant locations, Packing of (0, 1)-matrices, On optimal linear arrangements of trees, Bounds of the sum of edge lengths in linear arrangements of trees, Upper and Lower Bounds on the Complexity of the Min-Cut Linear Arrangement Problem on Trees