Minimal Interval Completion Through Graph Exploration

Abstract : Given an arbitrary graph G=(V,E) and an interval supergraph H=(V,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 ′) between G and H, H ′ is not an interval graph. In this paper we give an O(nm) time algorithm computing a minimal interval completion of an arbitrary graph. The output is an interval model of the completion.
Document type :
Conference papers
Complete list of metadatas

https://hal.archives-ouvertes.fr/hal-00462293
Contributor : Ioan Todinca <>
Submitted on : Tuesday, March 9, 2010 - 10:19:39 AM
Last modification on : Thursday, January 17, 2019 - 3:06:04 PM

Links full text

Identifiers

Collections

Citation

Karol Suchan, Ioan Todinca. Minimal Interval Completion Through Graph Exploration. Algorithms and Computation, 17th International Symposium (ISAAC 2006), Dec 2006, Kolkata, India. pp.517-526, ⟨10.1007/11940128_52⟩. ⟨hal-00462293⟩

Share

Metrics

Record views

120