Hereditary biclique-Helly graphs: recognition and maximal biclique enumeration - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Journal Articles Discrete Mathematics and Theoretical Computer Science Year : 2013

Hereditary biclique-Helly graphs: recognition and maximal biclique enumeration

Abstract

A biclique is a set of vertices that induce a complete bipartite graph. A graph G is biclique-Helly when its family of maximal bicliques satisfies the Helly property. If every induced subgraph of G is also biclique-Helly, then G is hereditary biclique-Helly. A graph is C4-dominated when every cycle of length 4 contains a vertex that is dominated by the vertex of the cycle that is not adjacent to it. In this paper we show that the class of hereditary biclique-Helly graphs is formed precisely by those C4-dominated graphs that contain no triangles and no induced cycles of length either 5 or 6. Using this characterization, we develop an algorithm for recognizing hereditary biclique-Helly graphs in O(n2+αm) time and O(n+m) space. (Here n, m, and α= O(m1/2) are the number of vertices and edges, and the arboricity of the graph, respectively.) As a subprocedure, we show how to recognize those C4-dominated graphs that contain no triangles in O(αm) time and O(n+m) space. Finally, we show how to enumerate all the maximal bicliques of a C4-dominated graph with no triangles in O(n2 + αm) time and O(αm) space.
Fichier principal
Vignette du fichier
1826-7686-1-PB.pdf (388.6 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

hal-00990606 , version 1 (13-05-2014)

Identifiers

Cite

Martiniano Eguia, Francisco Juan Soulignac. Hereditary biclique-Helly graphs: recognition and maximal biclique enumeration. Discrete Mathematics and Theoretical Computer Science, 2013, Vol. 15 no. 1 (1), pp.55--74. ⟨10.46298/dmtcs.626⟩. ⟨hal-00990606⟩

Collections

TDS-MACS
110 View
1277 Download

Altmetric

Share

Gmail Facebook X LinkedIn More