An \(O(n^3)\) time algorithm for recognizing threshold dimension 2 graphs (Q293369)
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: An O(n^3) time algorithm for recognizing threshold dimension 2 graphs |
scientific article; zbMATH DE number 6590757
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | An \(O(n^3)\) time algorithm for recognizing threshold dimension 2 graphs |
scientific article; zbMATH DE number 6590757 |
Statements
An \(O(n^3)\) time algorithm for recognizing threshold dimension 2 graphs (English)
0 references
9 June 2016
0 references
graph algorithms
0 references
threshold dimension 2 graphs
0 references
maximum cliques
0 references
0 references
0.7807450890541077
0 references
0.7790947556495667
0 references
0.7570642232894897
0 references
