Finding Independent Sets in Triangle-Free Graphs (Q4717575)
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 952599
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Finding Independent Sets in Triangle-Free Graphs |
scientific article; zbMATH DE number 952599 |
Statements
Finding Independent Sets in Triangle-Free Graphs (English)
0 references
1 December 1996
0 references
efficient algorithm
0 references
independent set
0 references
triangle-free graph
0 references
0.94761336
0 references
0.94511425
0 references
0.9392384
0 references
0.9289205
0 references
0.9215419
0 references
0.9208713
0 references
0.9201945
0 references
0.9188613
0 references
0.9164506
0 references
