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

M. C. Er (1987)

> Home

Details and statistics

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

access: closed

type: Journal Article

metadata version: 2017-05-27

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/isci/Er87
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/isci/Er87
M. C. Er:
A General Algorithm for Finding a Shortest Path between two n-Configurations. Inf. Sci. 42(2): 137-141 (1987)

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.