𝔖 Bobbio Scriptorium
✦   LIBER   ✦

An admissible and optimal algorithm for searching AND/OR graphs

✍ Scribed by C.L. Chang; J.R. Slagle

Publisher
Elsevier Science
Year
1971
Tongue
English
Weight
964 KB
Volume
2
Category
Article
ISSN
0004-3702

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Algorithms for searching explicit AND/OR
Algorithms for searching explicit AND/OR graphs and their applications to problem reduction search
✍ P.P. Chakrabarti πŸ“‚ Article πŸ“… 1994 πŸ› Elsevier Science 🌐 English βš– 756 KB

Chakrabarti, P.P., Algorithms for searching explicit AND/OR graphs and their applications to problem reduction search, Artificial Intelligence 65 (1994) 329-345. We present algorithms for finding out optimal cost solutions of an explicit AND/OR graph. We show that these new algorithms can work on A

An algorithm for drawing planar graphs
An algorithm for drawing planar graphs
✍ Bor Plestenjak πŸ“‚ Article πŸ“… 1999 πŸ› John Wiley and Sons 🌐 English βš– 382 KB πŸ‘ 2 views

A simple algorithm for drawing 3-connected planar graphs is presented. It is derived from the Fruchterman and Reingold spring embedding algorithm by deleting all repulsive forces and fixing vertices of an outer face. The algorithm is implemented in the system for manipulating discrete mathematical s