Bounds of the sum of edge lengths in linear arrangements of trees

DOI10.1088/1742-5468/abd4d7OpenAlexW3131054595MaRDI QIDQ5857519

Ramon Ferrer-i-Cancho, C. Gómez-Rodríguez, Juan Luis Esteban

Publication date: 1 April 2021

Published in: Journal of Statistical Mechanics: Theory and Experiment (Search for Journal in Brave)

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

zbMATH Keywords

communicationsupply and information networks

Mathematics Subject Classification ID

Statistical mechanics, structure of matter (82-XX)

Related Items (1)

The maximum linear arrangement problem for trees under projectivity and planarity

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Towards a theoretical framework for analyzing complex linguistic networks
• On optimal linear arrangements of trees
• Optimal one-page tree embeddings in linear time
• Arranging \(n\) distinct numbers on a line or a circle to reach extreme total variations
• Approximation algorithms for maximum linear arrangement
• Morphogenesis of spatial networks
• Are crossing dependencies really scarce?
• On Bipartite Drawings and the Linear Arrangement Problem
• The scaling of the minimum sum of edge lengths in uniformly random trees
• Distance Approximating Trees: Complexity and Algorithms
• Planar linear arrangements of outerplanar graphs
• Tree Isomorphism Algorithms: Speed vs. Clarity
• A Minimum Linear Arrangement Algorithm for Undirected Trees
• On the Maximum Crossing Number
• Edge crossings in random linear arrangements
• A Correction on Shiloach's Algorithm for Minimum Linear Arrangement of Trees
• Experiments on the minimum linear arrangement problem

This page was built for publication: Bounds of the sum of edge lengths in linear arrangements of trees