"Finding the Minimum Number of Open-Edge Guards in an Orthogonal Polygon is ..."

Chuzo Iwamoto (2017)

> Home

Details and statistics

DOI: 10.1587/TRANSINF.2016EDL8251

access: closed

type: Journal Article

metadata version: 2020-04-11

- view
  authority control:
- export record
  dblp key:
  - journals/ieicet/Iwamoto17
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/ieicet/Iwamoto17
Chuzo Iwamoto:
Finding the Minimum Number of Open-Edge Guards in an Orthogonal Polygon is NP-Hard. IEICE Trans. Inf. Syst. 100-D(7): 1521-1525 (2017)

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.