NP-hardness of the recognition of coordinated graphs (Q839773)
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: NP-hardness of the recognition of coordinated graphs |
scientific article; zbMATH DE number 5601633
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | NP-hardness of the recognition of coordinated graphs |
scientific article; zbMATH DE number 5601633 |
Statements
NP-hardness of the recognition of coordinated graphs (English)
0 references
3 September 2009
0 references
computational complexity
0 references
coordinated graph recognition
0 references
\(\{\)gem
0 references
C\(_{4}\), odd hole\(\}\)-free graphs
0 references
NP-complete problems
0 references
0 references
0 references
0.8353041410446167
0 references
0.8158528208732605
0 references
0.7969281673431396
0 references
0.7571307420730591
0 references
