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

Authors:
Christophe Crespelle;Ioan Todinca
Affiliations:
LIP6, Université Paris 6;LIFO, Université d'Orleans, Orleans Cedex 2, France
Venue:
TAMC'10 Proceedings of the 7th annual conference on Theory and Applications of Models of Computation
Year:
2010

Citing 11
Cited 2

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
Algorithmic Graph Theory and Perfect Graphs (Annals of Discrete Mathematics, Vol 57)

Algorithmic Graph Theory and Perfect Graphs (Annals of Discrete Mathematics, Vol 57)
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

Theoretical Computer Science
Approximating the path-distance-width for AT-free graphs and graphs in related classes

Discrete Applied Mathematics

Quantified Score

Hi-index	0.00

Visualization

Abstract

The minimal interval completion problem consists in adding edges to an arbitrary graph so that the resulting graph is an interval graph; the objective is to add an inclusion minimal set of edges, which means that no proper subset of the added edges can result in an interval graph when added to the original graph We give an ${\mathcal{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 lower this bound for the first time below the best known bound for minimal chordal completion.