"On the complexity of finding paths in a two-dimensional domain I: Shortest ..."

Arthur W. Chou, Ker-I Ko (2004)

Details and statistics

DOI: 10.1002/MALQ.200310120

access: closed

type: Journal Article

metadata version: 2017-05-17

a service of  Schloss Dagstuhl - Leibniz Center for Informatics