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

4Citations
Citations of this article
7Readers
Mendeley users who have this article in their library.

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(n2)-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. © 2013 Published by Elsevier B.V.

Cite

CITATION STYLE

APA

Crespelle, C., & Todinca, I. (2013). An O(n 2)-time algorithm for the minimal interval completion problem. In Theoretical Computer Science (Vol. 494, pp. 75–85). https://doi.org/10.1016/j.tcs.2012.12.031

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free