Tight lower bounds on the number of bicliques in false-twin-free graphs
A biclique is a maximal bipartite complete induced subgraph of G. Bicliques have been studied in the last years motivated by the large number of applications. In particular, enumeration of the maximal bicliques has been of interest in data analysis. Associated with this issue, bounds on the maximum...
Guardado en:
| Publicado: |
2016
|
|---|---|
| Materias: | |
| Acceso en línea: | https://bibliotecadigital.exactas.uba.ar/collection/paper/document/paper_03043975_v636_n_p77_Groshaus http://hdl.handle.net/20.500.12110/paper_03043975_v636_n_p77_Groshaus |
| Aporte de: |
Ejemplares similares
-
Tight lower bounds on the number of bicliques in false-twin-free graphs
por: Groshaus, M., et al. -
Tight lower bounds on the number of bicliques in false-twin-free graphs
Publicado: (2015) -
Tight lower bounds on the number of bicliques in false-twin-free graphs
por: Groshaus, M., et al. -
Hereditary biclique-Helly graphs: Recognition and maximal biclique enumeration
por: Soulignac, Francisco Juan
Publicado: (2013) -
Hereditary biclique-Helly graphs: Recognition and maximal biclique enumeration
por: Eguía, M., et al.