Linear Arrangement Problems and Interval Graphs

DOI10.1007/978-3-319-09174-7_31MaRDI QIDQ3195345zbMATH OpenOpenAlexFDO

Authors Alain Quilliot, Djamal Rebaine

Publication date 16 October 2015

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-319-09174-7_31

zbMATH Keywords

interval graphslinear arrangementlinear ordering

Mathematics Subject Classification ID

Graph representations (geometric and intersection representations, etc.) (05C62) Graph theory (including graph drawing) in computer science (68R10) Approximation algorithms (68W25) Programming involving graphs or networks (90C35)

Recommendations

• Optimal Linear Arrangement of Interval Graphs
• Lower and upper bounds for the linear arrangement problem on interval graphs
• The linear arrangement problem on recursively constructed graphs
• Linear arrangement problems on recursively partitioned graphs
• scientific article; zbMATH DE number 2159644
• scientific article; zbMATH DE number 2032341
• scientific article; zbMATH DE number 2073575
• Linear layouts of complete graphs
• Linear algorithm for domatic number problem on interval graphs
• On bipartite drawings and the linear arrangement problem

Cited in

(6)

• Linear algorithm for domatic number problem on interval graphs
• Generating lower bounds for the linear arrangement problem
• scientific article; zbMATH DE number 1161294 (Why is no real title available?)
• The linear arrangement problem on recursively constructed graphs
• Lower and upper bounds for the linear arrangement problem on interval graphs
• Optimal Linear Arrangement of Interval Graphs

This page was built for publication: Linear Arrangement Problems and Interval Graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3195345)