On fast path‐finding algorithms in AND‐OR graphs
George M. Adelson-Velsky, Alexander F. Gelbukh, Eugene Levner · Mathematical Problems in Engineering · 2002
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(np), which is superior to the complexity of previously known algorithms.