QPTAS and subexponential algorithm for maximum clique on disk graphs (Q5115779)
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 7236416
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | QPTAS and subexponential algorithm for maximum clique on disk graphs |
scientific article; zbMATH DE number 7236416 |
Statements
18 August 2020
0 references
disk graph
0 references
maximum clique
0 references
computational complexity
0 references
0 references
0.9371373653411864
0 references
0.8516349792480469
0 references
0.782773494720459
0 references
0.7802039384841919
0 references
0.7750494480133057
0 references
