A polynomial-time algorithm for the Independent Set problem in \(\{{P_{10}},C_4,C_6\}\)-free graphs (Q2301550)
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-time algorithm for the Independent Set problem in \P₁₀,C₄,C₆\-free graphs |
scientific article; zbMATH DE number 7173306
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A polynomial-time algorithm for the Independent Set problem in \(\{{P_{10}},C_4,C_6\}\)-free graphs |
scientific article; zbMATH DE number 7173306 |
Statements
A polynomial-time algorithm for the Independent Set problem in \(\{{P_{10}},C_4,C_6\}\)-free graphs (English)
0 references
24 February 2020
0 references
independent set
0 references
augmenting graph
0 references
polynomial-time algorithm
0 references
0.8526324033737183
0 references
0.8402619361877441
0 references
0.8292987942695618
0 references
0.8261771202087402
0 references
0.8235265612602234
0 references
