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, upper and lower bounds...
Guardado en:
| Publicado: |
2015
|
|---|---|
| Materias: | |
| Acceso en línea: | https://bibliotecadigital.exactas.uba.ar/collection/paper/document/paper_15710653_v50_n_p293_Groshaus http://hdl.handle.net/20.500.12110/paper_15710653_v50_n_p293_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: (2016) -
Tight lower bounds on the number of bicliques in false-twin-free graphs
por: Groshaus, M., et al. -
The number of convergent graphs under the biclique operator with no twin vertices is finite
por: Groshaus, Marina E., et al.
Publicado: (2009) -
The number of convergent graphs under the biclique operator with no twin vertices is finite
por: Groshaus, M.E., et al.