Skip to content
  • Home
  • Book Bag: 0 items (Full)
    • English
    • 日本語
    • 中文(简体)
    • 中文(繁體)
    • اللغة العربية
  • About
Advanced
  • A randomized algorithm for fin...
  • Cite this
  • Text this
  • Print
  • Export Record
    • Export to RefWorks
    • Export to EndNoteWeb
    • Export to EndNote
  • Add to Book Bag Remove from Book Bag
  • Permanent link

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

Discrete Algorithms

Bibliographic Details
Published in:Discrete Mathematics & Theoretical Computer Science
Main Authors: Sergio Cabello, Maria Saumell
Format: Article
Language:English
Published: Discrete Mathematics & Theoretical Computer Science 2015-01-01
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

  • On probe 2-clique graphs and probe diamond-free graphs
    by: Flavia Bonomo, et al.
    Published: (2015-03-01)
  • Extending a perfect matching to a Hamiltonian cycle
    by: Adel Alahmadi, et al.
    Published: (2015-03-01)
  • Snarks with total chromatic number 5
    by: Gunnar Brinkmann, et al.
    Published: (2015-05-01)
  • Maximum difference about the size of optimal identifying codes in graphs differing by one vertex
    by: Mikko Pelto
    Published: (2015-05-01)
  • Avoider-enforcer star games
    by: Andrzej Grzesik, et al.
    Published: (2015-03-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