"On the Complexity of two Circle Connecting Problems."

Name: dblp XML data dump
Creator: Schloss Dagstuhl - Leibniz Center for Informatics
Published: 1993
License: https://creativecommons.org/publicdomain/zero/1.0/
Keywords: dblp, XML, computer science, scholarly publications, metadata

Nen-Fu Huang (1993)

> Home

Details and statistics

DOI: 10.1016/0166-218X(93)90149-I

access: open

type: Journal Article

metadata version: 2021-02-11

- view
  - electronic edition via DOI (open access)
  authority control:
- export record
  dblp key:
  - journals/dam/Huang93
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/dam/Huang93
Nen-Fu Huang:
On the Complexity of two Circle Connecting Problems. Discret. Appl. Math. 47(1): 17-32 (1993)

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.