"Forward Chaining Algorithm for Solving the Shortest Path Problem in ..."

Silvana Petruseva (2009)

> Home

Details and statistics

DOI: 10.1007/978-3-642-04617-9_84

access: closed

type: Conference or Workshop Paper

metadata version: 2021-10-14

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - conf/ki/Petruseva09
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/ki/Petruseva09
Silvana Petruseva:
Forward Chaining Algorithm for Solving the Shortest Path Problem in Arbitrary Deterministic Environment in Linear Time - Applied for the Tower of Hanoi Problem. KI 2009: 672-679

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.