A polynomial algorithm to find an independent set of maximum weight in a fork-free graph (Q5901120): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1145/1109557.1109561 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W4232451777 / rank | |||
Normal rank | |||
Latest revision as of 01:07, 20 March 2024
scientific article; zbMATH DE number 5771586
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A polynomial algorithm to find an independent set of maximum weight in a fork-free graph |
scientific article; zbMATH DE number 5771586 |
Statements
A polynomial algorithm to find an independent set of maximum weight in a fork-free graph (English)
0 references
16 August 2010
0 references
