An integer programming model for the minimum interval graph completion problem

The minimum interval graph completion problem consists of, given a graph G = ( V, E ), finding a supergraph H = ( V, E ∪ F ) that is an interval graph, while adding the least number of edges |F| . We present an integer programming formulation for solving the minimum interval graph completion problem...

Full description

Bibliographic Details
Main Author: Lopes, Isabel Cristina (author)
Other Authors: Carvalho, J. M. Valerio de (author)
Format: conferenceObject
Language:eng
Published: 2015
Subjects:
Interval graph
Minimum interval completion
Minimum fill-in
Online Access:http://hdl.handle.net/10400.22/5826
Country:Portugal
Oai:oai:recipp.ipp.pt:10400.22/5826

Internet

http://hdl.handle.net/10400.22/5826

Similar Items