Maximum colorful independent sets in vertex-colored graphs (Q1792109)
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 colorful independent sets in vertex-colored graphs |
scientific article; zbMATH DE number 6952017
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Maximum colorful independent sets in vertex-colored graphs |
scientific article; zbMATH DE number 6952017 |
Statements
Maximum colorful independent sets in vertex-colored graphs (English)
0 references
11 October 2018
0 references
maximum colorful independent sets
0 references
vertex-colored graphs
0 references
polynomial-time algorithms
0 references
0 references
0.902919352054596
0 references
0.8999615907669067
0 references
0.7816151976585388
0 references
0.7802723050117493
0 references
0.7801471948623657
0 references
