A polynomial algorithm to find an independent set of maximum weight in a fork-free graph (Q5901434)
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: A polynomial algorithm to find an independent set of maximum weight in a fork-free graph |
scientific article; zbMATH DE number 5509890
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A polynomial algorithm to find an independent set of maximum weight in a fork-free graph |
scientific article; zbMATH DE number 5509890 |
Statements
A polynomial algorithm to find an independent set of maximum weight in a fork-free graph (English)
0 references
23 February 2009
0 references
independent set
0 references
polynomial-time algorithm
0 references
0 references
0 references
0 references
0.877644956111908
0 references
0.8287136554718018
0 references
0.8263040781021118
0 references
0.8195587992668152
0 references
0.8033109903335571
0 references
