Skip to content
VuFind
    • English
    • Deutsch
    • Español
    • Français
    • Italiano
    • 日本語
    • Nederlands
    • Português
    • Português (Brasil)
    • 中文(简体)
    • 中文(繁體)
    • Türkçe
    • עברית
    • Gaeilge
    • Cymraeg
    • Ελληνικά
    • Català
    • Euskara
    • Русский
    • Čeština
    • Suomi
    • Svenska
    • polski
    • Dansk
    • slovenščina
    • اللغة العربية
    • বাংলা
    • Galego
    • Tiếng Việt
    • Hrvatski
    • हिंदी
    • Հայերէն
    • Українська
    • Sámegiella
    • Монгол
Advanced
  • A randomized algorithm for fin...
  • Cite this
  • Text this
  • Email this
  • Print
  • Export Record
    • Export to RefWorks
    • Export to EndNoteWeb
    • Export to EndNote
  • Permanent link
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
  • Holdings
  • Description
  • Similar Items
  • Staff View

Internet

https://dmtcs.episciences.org/2126/pdf

Similar Items

  • Extending a perfect matching to a Hamiltonian cycle
    by: Adel Alahmadi, et al.
    Published: (2015-03-01)
  • On probe 2-clique graphs and probe diamond-free graphs
    by: Flavia Bonomo, et al.
    Published: (2015-03-01)
  • Clique-transversal sets and weak 2-colorings in graphs of small maximum degree
    by: Gábor Bacsó, et al.
    Published: (2009-01-01)
  • Complexity results on graphs with few cliques
    by: Bill Rosgen, et al.
    Published: (2007-01-01)
  • Independent sets in graphs with an excluded clique minor
    by: David R. Wood
    Published: (2007-01-01)

Search Options

  • Search History
  • Advanced Search

Find More

  • Browse the Catalog
  • Browse Alphabetically
  • Explore Channels
  • Course Reserves
  • New Items

Need Help?

  • Search Tips
  • Ask a Librarian
  • FAQs