A randomized algorithm for finding a maximum clique in the visibility graph of a simple polygon

A randomized algorithm for finding a maximum clique in the visibility graph of a simple polygon

Discrete Algorithms

Bibliographic Details
Main Authors: Sergio Cabello, Maria Saumell
Format: Article
Language:English
Published: Discrete Mathematics & Theoretical Computer Science 2015-01-01
Series:Discrete Mathematics & Theoretical Computer Science
Subjects:
randomized algorithm
visibility graph
maximum clique
simple polygon
[info.info-dm] computer science [cs]/discrete mathematics [cs.dm]
[info.info-hc] computer science [cs]/human-computer interaction [cs.hc]
Online Access:https://dmtcs.episciences.org/2126/pdf
Description
Summary:Discrete Algorithms
ISSN:1365-8050

Similar Items