Efficient algorithms for finding maximum cliques of an overlap graph (Q3471882)
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 4139516
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Efficient algorithms for finding maximum cliques of an overlap graph |
scientific article; zbMATH DE number 4139516 |
Statements
Efficient algorithms for finding maximum cliques of an overlap graph (English)
0 references
1990
0 references
maximum clique
0 references
NP-complete
0 references
polynomial time
0 references
overlap graph
0 references
time complexity
0 references
0.9015600681304932
0 references
0.8492191433906555
0 references
0.815157413482666
0 references
0.815157413482666
0 references
0.8149820566177368
0 references
