An optimal greedy heuristic to color interval graphs
Information Processing Letters
Fixed-parameter tractability of graph modification problems for hereditary properties
Information Processing Letters
A Linear-Time Algorithm for Finding Tree-Decompositions of Small Treewidth
SIAM Journal on Computing
Separability generalizes Dirac's theorem
Discrete Applied Mathematics
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
Minimal proper interval completions
WG'06 Proceedings of the 32nd international conference on Graph-Theoretic Concepts in Computer Science
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
Minimal comparability completions of arbitrary graphs
Discrete Applied Mathematics
Characterizing and Computing Minimal Cograph Completions
FAW '08 Proceedings of the 2nd annual international workshop on Frontiers in Algorithmics
Theoretical Computer Science
Characterizing and computing minimal cograph completions
Discrete Applied Mathematics
| Hi-index | 0.00 |
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 ${{\mathcal{O}}(nm)}$ time algorithm computing a minimal interval completion of an arbitrary graph. The output is an interval model of the completion.