"A General Algorithm for Finding a Shortest Path between two n-Configurations."

M. C. Er (1987)

Details and statistics

DOI: 10.1016/0020-0255(87)90020-X

access: closed

type: Journal Article

metadata version: 2017-05-27

a service of  Schloss Dagstuhl - Leibniz Center for Informatics