Minimal interval completions

Authors:
Pinar Heggernes;Karol Suchan;Ioan Todinca;Yngve Villanger
Affiliations:
Department of Informatics, University of Bergen, Bergen, Norway;LIFO, Université d’Orleans, Orleans, France;LIFO, Université d’Orleans, Orleans, France;Department of Informatics, University of Bergen, Bergen, Norway
Venue:
ESA'05 Proceedings of the 13th annual European conference on Algorithms
Year:
2005

Citing 4
Cited 13

On the pathwidth of chordal graphs

Discrete Applied Mathematics - ARIDAM IV and V
On treewidth and minimum fill-in of asteroidal triple-free graphs

Ordal'94 Selected papers from the conference on Orders, algorithms and applications
Characterizations and algorithmic applications of chordal graph embeddings

Proceedings of the 4th Twente workshop on Graphs and combinatorial optimization
Treewidth and Minimum Fill-in: Grouping the Minimal Separators

SIAM Journal on Computing

Interval completion with few edges

Proceedings of the thirty-ninth annual ACM symposium on Theory of computing
Minimal proper interval completions

Information Processing Letters
Minimal interval completion through graph exploration

Theoretical Computer Science
Dynamically maintaining split graphs

Discrete Applied Mathematics
Minimal split completions

Discrete Applied Mathematics
Characterizing minimal interval completions towards better understanding of profile and pathwidth

STACS'07 Proceedings of the 24th annual conference on Theoretical aspects of computer science
Exact algorithms for intervalizing colored graphs

TAPAS'11 Proceedings of the First international ICST conference on Theory and practice of algorithms in (computer) systems
Minimal proper interval completions

WG'06 Proceedings of the 32nd international conference on Graph-Theoretic Concepts in Computer Science
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
Making arbitrary graphs transitively orientable: minimal comparability completions

ISAAC'06 Proceedings of the 17th international conference on Algorithms and Computation
Minimal interval completion through graph exploration

ISAAC'06 Proceedings of the 17th international conference on Algorithms and Computation
Minimal split completions of graphs

LATIN'06 Proceedings of the 7th Latin American conference on Theoretical Informatics
An O( n2)-time algorithm for the minimal interval completion problem

Theoretical Computer Science

Quantified Score

Hi-index	0.00

Visualization

Abstract

We study the problem of adding edges to an arbitrary graph so that the resulting graph is an interval graph. Our 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 a polynomial time algorithm to obtain a minimal interval completion of an arbitrary graph, thereby resolving the complexity of this problem.