Polynomial algorithm for finding the largest independent sets in graphs without forks (Q4936659)
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: Publication:4936659 |
scientific article; zbMATH DE number 1396704
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Polynomial algorithm for finding the largest independent sets in graphs without forks |
scientific article; zbMATH DE number 1396704 |
Statements
Polynomial algorithm for finding the largest independent sets in graphs without forks (English)
0 references
31 January 2000
0 references
algorithm
0 references
independent set
0 references
0.877644956111908
0 references
0.7943065166473389
0 references
0.7917701005935669
0 references
0.769263505935669
0 references
0.7680684328079224
0 references
