On independent sets and bicliques in graphs (Q2428684)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 6028439
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On independent sets and bicliques in graphs |
scientific article; zbMATH DE number 6028439 |
Statements
On independent sets and bicliques in graphs (English)
0 references
26 April 2012
0 references
counting algorithms
0 references
combinatorial bound
0 references
maximal bicliques
0 references
maximal independent sets
0 references
exact exponential time algorithm
0 references
0 references
0.9576945304870604
0 references
0.8572589159011841
0 references
0.8433728218078613
0 references
0.8418713808059692
0 references
0.8185513019561768
0 references
