Algorithms for maximumk-colorings andk-coverings of transitive graphs (Q3783310)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 4045770
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Algorithms for maximumk-colorings andk-coverings of transitive graphs |
scientific article; zbMATH DE number 4045770 |
Statements
Algorithms for maximumk-colorings andk-coverings of transitive graphs (English)
0 references
1987
0 references
maximum k-coloring problem
0 references
maximum k-covering problem
0 references
polynomial time algorithms
0 references
0.7999981641769409
0 references
0.7713518142700195
0 references
0.7566172480583191
0 references
0.7504348158836365
0 references
