An integer programming model for the Minimum Interval Graph Completion Problem

DOI10.1016/j.endm.2010.05.074zbMath1237.90205OpenAlexW2046590080MaRDI QIDQ2883618

Isabel Cristina Lopes, José M. Valério de Carvalho

Publication date: 13 May 2012

Published in: Electronic Notes in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.endm.2010.05.074

zbMATH Keywords

interval graphminimum fill-inminimum interval completion

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Combinatorial optimization (90C27)

Cites Work

• Unnamed Item
• Minimal triangulations of graphs: a survey
• Minimal split completions
• Profile minimization problem for matrices and graphs
• On the complexity of DNA physical mapping
• On treewidth and minimum fill-in of asteroidal triple-free graphs
• Minimal comparability completions of arbitrary graphs
• Incidence matrices, interval graphs and seriation in archeology
• On the homogeneous representation of interval graphs
• A survey of solved problems and applications on bandwidth, edgesum, and profile of graphs

This page was built for publication: An integer programming model for the Minimum Interval Graph Completion Problem