"On the Complexity of two Circle Connecting Problems."

Nen-Fu Huang (1993)

Details and statistics

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

access: open

type: Journal Article

metadata version: 2021-02-11

a service of  Schloss Dagstuhl - Leibniz Center for Informatics