Maximum weight independent sets for (\(S_{1,2,4}\),triangle)-free graphs in polynomial time (Q2043008)
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: Maximum weight independent sets for (\(S_{1,2,4}\),triangle)-free graphs in polynomial time |
scientific article; zbMATH DE number 7373863
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Maximum weight independent sets for (\(S_{1,2,4}\),triangle)-free graphs in polynomial time |
scientific article; zbMATH DE number 7373863 |
Statements
Maximum weight independent sets for (\(S_{1,2,4}\),triangle)-free graphs in polynomial time (English)
0 references
22 July 2021
0 references
\( S_{1, 2, 4}\)-free graphs
0 references
triangle-free graphs
0 references
polynomial time algorithm
0 references
anti-neighborhood approach
0 references
0 references
0 references
0 references
0 references
0 references
0 references
