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

Authors:
Christophe Crespelle;Ioan Todinca
Affiliations:
Université Claude Bernard Lyon 1, D-NET/INRIA, LIP, CNRS, ENS de Lyon, Université de Lyon, France;LIFO, Université d'Orleans, BP 6759, F-45067 Orleans Cedex 2, France
Venue:
Theoretical Computer Science
Year:
2013

Citing 13
Cited 0

Complexity of finding embeddings in a k-tree

SIAM Journal on Algebraic and Discrete Methods
An incremental linear-time algorithm for recognizing interval graphs

SIAM Journal on Computing
Mapping the genome: some combinatorial problems arising in molecular biology

STOC '93 Proceedings of the twenty-fifth annual ACM symposium on Theory of computing
Computers and Intractability: A Guide to the Theory of NP-Completeness

Computers and Intractability: A Guide to the Theory of NP-Completeness
Computing Minimal Triangulations in Time O(n\alpha \log n) = o(n2.376)

SIAM Journal on Discrete Mathematics
Minimal comparability completions of arbitrary graphs

Discrete Applied Mathematics
Minimal proper interval completions

Information Processing Letters
Minimal interval completion through graph exploration

Theoretical Computer Science
Minimal split completions

Discrete Applied Mathematics
Fully Dynamic Representations of Interval Graphs

Graph-Theoretic Concepts in Computer Science
Testing for the consecutive ones property, interval graphs, and graph planarity using PQ-tree algorithms

Journal of Computer and System Sciences
Minimal interval completions

ESA'05 Proceedings of the 13th annual European conference on Algorithms
An O(n2)-time algorithm for the minimal interval completion problem

TAMC'10 Proceedings of the 7th annual conference on Theory and Applications of Models of Computation

Quantified Score

Hi-index	5.23

Visualization

Abstract

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(n^2)-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.