Computing the maximum clique in the visibility graph of a simple polygon (Q2466015)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Computing the maximum clique in the visibility graph of a simple polygon |
scientific article |
Statements
Computing the maximum clique in the visibility graph of a simple polygon (English)
0 references
11 January 2008
0 references
algorithm
0 references
convexity
0 references
convex fan
0 references
dynamic programming
0 references
Hamiltonian cycle
0 references
hidden vertex set
0 references
maximum clique
0 references
simple polygon
0 references
visibility graph
0 references
