A Correction on Shiloach's Algorithm for Minimum Linear Arrangement of Trees

DOI10.1137/15M1046289zbMath1367.05033arXiv1511.01061MaRDI QIDQ5283240

Juan Luis Esteban, Ramon Ferrer-i-Cancho

Publication date: 21 July 2017

Published in: SIAM Journal on Computing (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1511.01061

zbMATH Keywords

minimum linear arrangementShiloach's algorithm

Mathematics Subject Classification ID

Trees (05C05) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (4)

Ordering a Sparse Graph to Minimize the Sum of Right Ends of Edges ⋮ Reappraising the distribution of the number of edge crossings of graphs on a sphere ⋮ Bounds of the sum of edge lengths in linear arrangements of trees ⋮ On an ordering problem in weighted hypergraphs

Cites Work

• On optimal linear arrangements of trees
• Parallel algorithms for the minimum cut and the minimum length tree layout problems
• The scaling of the minimum sum of edge lengths in uniformly random trees
• A Minimum Linear Arrangement Algorithm for Undirected Trees
• A survey of solved problems and applications on bandwidth, edgesum, and profile of graphs
• Unnamed Item

This page was built for publication: A Correction on Shiloach's Algorithm for Minimum Linear Arrangement of Trees