Cabello, S., & Saumell, M. (2015). A randomized algorithm for finding a maximum clique in the visibility graph of a simple polygon. Discrete Mathematics & Theoretical Computer Science.
Chicago Style (17th ed.) CitationCabello, Sergio, and Maria Saumell. A Randomized Algorithm for Finding a Maximum Clique in the Visibility Graph of a Simple Polygon. Discrete Mathematics & Theoretical Computer Science, 2015.
MLA (9th ed.) CitationCabello, Sergio, and Maria Saumell. A Randomized Algorithm for Finding a Maximum Clique in the Visibility Graph of a Simple Polygon. Discrete Mathematics & Theoretical Computer Science, 2015.
Warning: These citations may not always be 100% accurate.