An O(n2)-time algorithm for the minimal interval completion problem

An interval completion of an arbitrary graph G is an interval graph H, on the same vertex set, obtained from G by adding new edges. If the set of newly added edges is inclusion-minimal among all possibilities, we say that H is a minimal interval completion of G. We give an O(n2)-time algorithm to ob...

Full description

Saved in:
Bibliographic Details
Published inTheoretical computer science Vol. 494; pp. 75 - 85
Main Authors Crespelle, Christophe, Todinca, Ioan
Format Journal Article
LanguageEnglish
Published Elsevier B.V 08.07.2013
Elsevier
Subjects
Computer Science
Data Structures and Algorithms
Graph algorithms
Interval graphs
Minimal interval completions
Interval graphs
Minimal interval completions
Graph algorithms
Online AccessGet full text
ISSN0304-3975
1879-2294
DOI10.1016/j.tcs.2012.12.031

Cover

More Information
Summary:An interval completion of an arbitrary graph G is an interval graph H, on the same vertex set, obtained from G by adding new edges. If the set of newly added edges is inclusion-minimal among all possibilities, we say that H is a minimal interval completion of G. We give an O(n2)-time algorithm to obtain a minimal interval completion of an arbitrary graph. This improves the previous O(nm) time bound for the problem and lowers this bound for the first time below the best known bound for minimal chordal completion.
ISSN:0304-3975
1879-2294
DOI:10.1016/j.tcs.2012.12.031