Efficient algorithms for finding maximum cliques of an overlap graph (Q3471882)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Efficient algorithms for finding maximum cliques of an overlap graph |
scientific article |
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
