On fast path-finding algorithms in AND-OR graphs

On fast path-finding algorithms in AND-OR graphs

<p>We present a polynomial-time path-finding algorithm in AND-OR graphs Given <math alttext="$p$"> <mi>p</mi> </math> arcs and <math alttext="$n$"> <mi>n</mi> </math> nodes, the complexity of the algorithm is <math alttext...

Full description

Bibliographic Details
Main Authors: Adelson-Velsky George M., Gelbukh Alexander, Levner Eugene
Format: Article
Language:English
Published: Hindawi Limited 2002-01-01
Series:Mathematical Problems in Engineering
Subjects:
AND-OR graphs; Extremal paths; Scheduling; Routing; Polynomial-time algorithms
Online Access:http://www.hindawi.net/access/get.aspx?journal=mpe&volume=8&pii=S1024123X02002004

Internet

http://www.hindawi.net/access/get.aspx?journal=mpe&volume=8&pii=S1024123X02002004

Similar Items