On fast path-finding algorithms in AND-OR graphs

George M. Adelson-Velsky, Alexander Gelbukh and Eugene Levner

Mathematical Problems in Engineering, 2002, vol. 8, 1-11

Abstract:

We present a polynomial-time path-finding algorithm in AND-OR graphs Given p arcs and n nodes, the complexity of the algorithm is O ( n p ) , which is superior to the complexity of previously known algorithms.

Date: 2002
References: Add references at CitEc
Citations:

Downloads: (external link)
http://downloads.hindawi.com/journals/MPE/8/869860.pdf (application/pdf)
http://downloads.hindawi.com/journals/MPE/8/869860.xml (text/xml)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:hin:jnlmpe:869860

DOI: 10.1080/10241230306728

Access Statistics for this article

More articles in Mathematical Problems in Engineering from Hindawi
Bibliographic data for series maintained by Mohamed Abdelhakeem ().