Consensus algorithms for the generation of all maximal bicliques (Q705493)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Consensus algorithms for the generation of all maximal bicliques |
scientific article; zbMATH DE number 2131568
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Consensus algorithms for the generation of all maximal bicliques |
scientific article; zbMATH DE number 2131568 |
Statements
Consensus algorithms for the generation of all maximal bicliques (English)
0 references
31 January 2005
0 references
Maximal complete bipartite subgraph
0 references
Biclique
0 references
Consensus-type algorithm
0 references
Algorithmic graph theory
0 references
Incremental polynomial enumeration
0 references
0.8120205998420715
0 references
0.7916162014007568
0 references
0.7769370675086975
0 references
0.7699938416481018
0 references
0.7685408592224121
0 references
