A randomized algorithm for finding a maximum clique in the visibility graph of a simple polygon.
Sergio CabelloMaria SaumellPublished in: Discret. Math. Theor. Comput. Sci. (2015)
Keyphrases
- maximum clique
- randomized algorithm
- branch and bound algorithm
- association graph
- lower bound
- simple polygon
- maximal cliques
- computational biology
- greedy algorithm
- graph theory
- upper bound
- branch and bound
- precedence constraints
- graph matching
- search algorithm
- optimal solution
- machine learning
- graph theoretic
- dynamic programming
- single machine scheduling problem
- special case
- contact map
- objective function
- multiscale