Minimal interval completion through graph exploration

Authors:
Karol Suchan;Ioan Todinca
Affiliations:
Departamento de Ingeniería Matemática, Universidad de Chile, Santiago, Chile and Department of Discrete Mathematics, Faculty of Applied Mathematics, AGH - University of Science and Techn ...;LIFO, Université dOrléans, 45067 Orléans Cedex 2, France
Venue:
Theoretical Computer Science
Year:
2009

Citing 13
Cited 3

An optimal greedy heuristic to color interval graphs

Information Processing Letters
On the pathwidth of chordal graphs

Discrete Applied Mathematics - ARIDAM IV and V
Separability generalizes Dirac's theorem

Discrete Applied Mathematics
Lex-BFS and partition refinement, with applications to transitive orientation, interval graph recognition and consecutive ones testing

Theoretical Computer Science
Computers and Intractability: A Guide to the Theory of NP-Completeness

Computers and Intractability: A Guide to the Theory of NP-Completeness
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α log n) = o(n2.376)

SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
Recognition and computation of minimal triangulations for AT-free claw-free and co-comparability graphs

Discrete Applied Mathematics
Minimal comparability completions of arbitrary graphs

Discrete Applied Mathematics
Treewidth: structure and algorithms

SIROCCO'07 Proceedings of the 14th international conference on Structural information and communication complexity
Minimal proper interval completions

WG'06 Proceedings of the 32nd international conference on Graph-Theoretic Concepts in Computer Science
Minimal interval completions

ESA'05 Proceedings of the 13th annual European conference on Algorithms
Minimal split completions of graphs

LATIN'06 Proceedings of the 7th Latin American conference on Theoretical Informatics

Optimal network locality in distributed virtualized data-centers

Computer Communications
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
An O( n2)-time algorithm for the minimal interval completion problem

Theoretical Computer Science

Quantified Score

Hi-index	5.23

Visualization

Abstract

Given an arbitrary graph G=(V,E) and an interval graph H=(V,F) with E@?F we say that H is an interval completion of G. The graph H is called a minimal interval completion of G if, for any sandwich graph H^'=(V,F^') with E@?F^'@?F, H^' is not an interval graph. In this paper we give a O(nm) time algorithm computing a minimal interval completion of an arbitrary graph. The output is an interval model of the completion.