"Computing the maximum clique in the visibility graph of a simple polygon."

Subir Kumar Ghosh et al. (2007)

> Home

Details and statistics

DOI: 10.1016/J.JDA.2006.09.004

access: open

type: Journal Article

metadata version: 2021-02-16

- view
  - electronic edition via DOI (open access)
  authority control:
- export record
  dblp key:
  - journals/jda/GhoshSBG07
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/jda/GhoshSBG07
Subir Kumar Ghosh, Thomas C. Shermer, Binay K. Bhattacharya, Partha P. Goswami:
Computing the maximum clique in the visibility graph of a simple polygon. J. Discrete Algorithms 5(3): 524-532 (2007)

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.