Optimizing weakly triangulated graphs (Q1822967)
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 4114006
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Optimizing weakly triangulated graphs |
scientific article; zbMATH DE number 4114006 |
Statements
Optimizing weakly triangulated graphs (English)
0 references
1989
0 references
weakly triangulated graphs
0 references
optimization problems
0 references
maximum clique
0 references
minimum colouring
0 references
maximum stable set
0 references
minimum clique covering
0 references
0.9164694547653198
0 references
0.8668083548545837
0 references
0.8305081725120544
0 references
0.8169824481010437
0 references