Minimum Weighted Coloring of Triangulated Graphs, with Application to Maximum Weight Vertex Packing and Clique Finding in Arbitrary Graphs (Q3210198)
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: Publication:3210198 |
scientific article; zbMATH DE number 4191146
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Minimum Weighted Coloring of Triangulated Graphs, with Application to Maximum Weight Vertex Packing and Clique Finding in Arbitrary Graphs |
scientific article; zbMATH DE number 4191146 |
Statements
Minimum Weighted Coloring of Triangulated Graphs, with Application to Maximum Weight Vertex Packing and Clique Finding in Arbitrary Graphs (English)
0 references
1991
0 references
triangulated graphs
0 references
graph coloring
0 references
vertex packing
0 references
maximum clique finding
0 references
0.8742049932479858
0 references
0.8719804883003235
0 references
0.8598510026931763
0 references
0.8589279651641846
0 references
