A randomized algorithm for finding a maximum clique in the visibility graph of a simple polygon
Discrete Algorithms
| Main Authors: | , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Discrete Mathematics & Theoretical Computer Science
2015-01-01
|
| Series: | Discrete Mathematics & Theoretical Computer Science |
| Subjects: | |
| Online Access: | https://dmtcs.episciences.org/2126/pdf |
| _version_ | 1827323835786985472 |
|---|---|
| author | Sergio Cabello Maria Saumell |
| author_facet | Sergio Cabello Maria Saumell |
| author_sort | Sergio Cabello |
| collection | DOAJ |
| description | Discrete Algorithms |
| first_indexed | 2024-04-25T01:58:55Z |
| format | Article |
| id | doaj.art-d152fa3555d241a79e4913e3bf711481 |
| institution | Directory Open Access Journal |
| issn | 1365-8050 |
| language | English |
| last_indexed | 2024-04-25T01:58:55Z |
| publishDate | 2015-01-01 |
| publisher | Discrete Mathematics & Theoretical Computer Science |
| record_format | Article |
| series | Discrete Mathematics & Theoretical Computer Science |
| spelling | doaj.art-d152fa3555d241a79e4913e3bf7114812024-03-07T15:27:55ZengDiscrete Mathematics & Theoretical Computer ScienceDiscrete Mathematics & Theoretical Computer Science1365-80502015-01-01Vol. 17 no. 1Discrete Algorithms10.46298/dmtcs.21262126A randomized algorithm for finding a maximum clique in the visibility graph of a simple polygonSergio Cabello0https://orcid.org/0000-0002-3183-4126Maria Saumell1https://orcid.org/0000-0002-4704-2609Department of MathematicsEuropean Centre of Excellence NTISDiscrete Algorithmshttps://dmtcs.episciences.org/2126/pdfrandomized algorithmvisibility graphmaximum cliquesimple polygon[info.info-dm] computer science [cs]/discrete mathematics [cs.dm][info.info-hc] computer science [cs]/human-computer interaction [cs.hc] |
| spellingShingle | Sergio Cabello Maria Saumell A randomized algorithm for finding a maximum clique in the visibility graph of a simple polygon Discrete Mathematics & Theoretical Computer Science 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] |
| title | A randomized algorithm for finding a maximum clique in the visibility graph of a simple polygon |
| title_full | A randomized algorithm for finding a maximum clique in the visibility graph of a simple polygon |
| title_fullStr | A randomized algorithm for finding a maximum clique in the visibility graph of a simple polygon |
| title_full_unstemmed | A randomized algorithm for finding a maximum clique in the visibility graph of a simple polygon |
| title_short | A randomized algorithm for finding a maximum clique in the visibility graph of a simple polygon |
| title_sort | randomized algorithm for finding a maximum clique in the visibility graph of a simple polygon |
| topic | 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] |
| url | https://dmtcs.episciences.org/2126/pdf |
| work_keys_str_mv | AT sergiocabello arandomizedalgorithmforfindingamaximumcliqueinthevisibilitygraphofasimplepolygon AT mariasaumell arandomizedalgorithmforfindingamaximumcliqueinthevisibilitygraphofasimplepolygon AT sergiocabello randomizedalgorithmforfindingamaximumcliqueinthevisibilitygraphofasimplepolygon AT mariasaumell randomizedalgorithmforfindingamaximumcliqueinthevisibilitygraphofasimplepolygon |