"The Computational Complexity of some Guard Sets in Polygons."

Uwe Ahlfeld, Hans-Dietrich Hecker (1992)

> Home

Details and statistics

DOI: —

access: unavailable

type: Journal Article

metadata version: 2020-03-06

- no documents available
- export record
  dblp key:
  - journals/eik/AhlfeldH92
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/eik/AhlfeldH92
Uwe Ahlfeld, Hans-Dietrich Hecker:
The Computational Complexity of some Guard Sets in Polygons. J. Inf. Process. Cybern. 28(6): 331-342 (1992)

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.