Skip to Main content Skip to Navigation
Other publications

Maximal cliques structure for cocomparability graphs and applications

Abstract : A cocomparability graph is a graph whose complement admits a transitive orientation. An interval graph is the intersection graph of a family of intervals on the real line. In this paper we investigate the relationships between interval and cocomparabil-ity graphs. This study is motivated by recent results [5, 13] that show that for some problems, the algorithm used on interval graphs can also be used with small modifications on cocomparability graphs. Many of these algorithms are based on graph searches that preserve cocomparability orderings. First we propose a characterization of cocomparability graphs via a lattice structure on the set of their maximal cliques. Using this characterization we can prove that every maximal interval subgraph of a cocomparability graph G is also a maximal chordal subgraph of G. Although the size of this lattice of maximal cliques can be exponential in the size of the graph, it can be used as a framework to design and prove algorithms on cocomparability graphs. In particular we show that a new graph search, namely Local Maximal Neighborhood Search (LocalMNS) leads to an O(n + mlogn) time algorithm to find a maximal interval subgraph of a cocomparability graph. Similarly we propose a linear time algorithm to compute all simplicial vertices in a cocomparability graph. In both cases we improve on the current state of knowledge.
Document type :
Other publications
Complete list of metadatas

Cited literature [38 references]  Display  Hide  Download

https://hal.inria.fr/hal-01393927
Contributor : Michel Habib <>
Submitted on : Tuesday, November 8, 2016 - 12:52:45 PM
Last modification on : Friday, April 10, 2020 - 5:28:35 PM
Document(s) archivé(s) le : Wednesday, March 15, 2017 - 12:01:16 AM

File

cocompstructure.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : hal-01393927, version 1
  • ARXIV : 1611.02002

Collections

Citation

Jérémie Dusart, Michel Habib, Derek G. Corneil. Maximal cliques structure for cocomparability graphs and applications. 2016. ⟨hal-01393927⟩

Share

Metrics

Record views

200

Files downloads

229