Algorithmic Aspects of the Intersection and Overlap Numbers of a Graph

Abstract : The intersection number of a graph G is the minimum size of a set S such that G is an intersection graph of some family of subsets F⊆2^S. The overlap number of G is defined similarly, except that G is required to be an overlap graph of F. Computing the overlap number of a graph has been stated as an open problem in [B. Rosgen and L. Stewart, 2010, arXiv:1008.2170v2] and [D.W. Cranston, et al., J. Graph Theory., 2011]. In this paper we show two algorithmic aspects concerning both these graph invariants. On the one hand, we show that the corresponding optimization problems associated with these numbers are both APX-hard, where for the intersection number our results hold even for biconnected graphs of maximum degree 7, strengthening the previously known hardness result. On the other hand, we show that the recognition problem for any specific intersection graph class (e.g. interval, unit disc, ...) is easy when restricted to graphs with fixed intersection number.
Document type :
Conference papers
Complete list of metadatas

Cited literature [18 references]  Display  Hide  Download

https://hal-upec-upem.archives-ouvertes.fr/hal-01054925
Contributor : Stéphane Vialette <>
Submitted on : Sunday, August 10, 2014 - 12:12:54 AM
Last modification on : Thursday, September 20, 2018 - 7:54:02 AM
Long-term archiving on : Wednesday, November 26, 2014 - 4:56:34 PM

File

OverlapNumber.pdf
Files produced by the author(s)

Identifiers

Collections

Citation

Danny Hermelin, Romeo Rizzi, Stéphane Vialette. Algorithmic Aspects of the Intersection and Overlap Numbers of a Graph. ISAAC 2012, Dec 2012, Taipei, Taiwan. pp.465-474, ⟨10.1007/978-3-642-35261-4_49⟩. ⟨hal-01054925⟩

Share

Metrics

Record views

448

Files downloads

164