Lower and upper bounds for the linear arrangement problem on interval graphs
From MaRDI portal
Publication:4634312
DOI10.1051/ro/2017011zbMath1411.90299OpenAlexW2593872908MaRDI QIDQ4634312
Alain Quilliot, Hélène Toussaint, Djamal Rebaine
Publication date: 7 May 2019
Published in: RAIRO - Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1051/ro/2017011
Cites Work
- An optimal time algorithm for minimum linear arrangement of chord graphs
- Simple linear time recognition of unit interval graphs
- On optimal linear arrangements of trees
- A note on line digraphs and the directed max-cut problem
- On minimum cuts and the linear arrangement problem
- Generating lower bounds for the linear arrangement problem
- Optimal labelling of unit interval graphs
- Optimal linear arrangement of a rectangular grid
- An effective two-stage simulated annealing algorithm for the minimum linear arrangement problem
- Decorous Lower Bounds for Minimum Linear Arrangement
- A polynomial algorithm for minDSC on a subclass of series Parallel graphs
- Planar linear arrangements of outerplanar graphs
- On the cut polytope
- The Sharpest Cut
- Voting Procedures, Complexity of
- Deterministic Algorithms for Rank Aggregation and Other Ranking and Clustering Problems
- Experiments on the minimum linear arrangement problem
- Optimal Linear Arrangement of Interval Graphs
- Aggregating inconsistent information
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Lower and upper bounds for the linear arrangement problem on interval graphs