Martiniano Eguia ; Francisco Juan Soulignac - Hereditary biclique-Helly graphs: recognition and maximal biclique enumeration

dmtcs:626 - Discrete Mathematics & Theoretical Computer Science, February 10, 2013, Vol. 15 no. 1 - https://doi.org/10.46298/dmtcs.626
Hereditary biclique-Helly graphs: recognition and maximal biclique enumerationArticle

Authors: Martiniano Eguia 1; Francisco Juan Soulignac ORCID1

  • 1 Departamento de Computación [Buenos Aires]

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.


Volume: Vol. 15 no. 1
Section: Graph and Algorithms
Published on: February 10, 2013
Accepted on: June 9, 2015
Submitted on: March 10, 2011
Keywords: [INFO.INFO-DM] Computer Science [cs]/Discrete Mathematics [cs.DM]

Consultation statistics

This page has been seen 439 times.
This article's PDF has been downloaded 658 times.