"A P-Completeness Result for Visibility Graphs of Simple Polygons."

Jana Dietel, Hans-Dietrich Hecker (2000)

> Home

Details and statistics

DOI: 10.1002/1521-3870(200008)46:3<361::AID-MALQ361>3.0.CO;2-0

access: closed

type: Journal Article

metadata version: 2017-05-17

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/mlq/DietelH00
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/mlq/DietelH00
Jana Dietel, Hans-Dietrich Hecker:
A P-Completeness Result for Visibility Graphs of Simple Polygons. Math. Log. Q. 46(3): 361-375 (2000)

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.