Computing the clique number of \(a\)-perfect graphs in polynomial time (Q2857431)
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 6222089
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Computing the clique number of \(a\)-perfect graphs in polynomial time |
scientific article; zbMATH DE number 6222089 |
Statements
1 November 2013
0 references
Computing the clique number of \(a\)-perfect graphs in polynomial time (English)
0 references
0.9984782934188844
0 references
0.8719831705093384
0 references
0.8664441108703613
0 references
0.8284152746200562
0 references
0.8281697630882263
0 references
