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...
| Main Authors: | , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Hindawi Limited
2002-01-01
|
| Series: | Mathematical Problems in Engineering |
| Subjects: | |
| Online Access: | http://www.hindawi.net/access/get.aspx?journal=mpe&volume=8&pii=S1024123X02002004 |
| id |
doaj-52cf7836d4934326a989868759ada7bf |
|---|---|
| record_format |
Article |
| spelling |
doaj-52cf7836d4934326a989868759ada7bf2020-11-25T00:36:42ZengHindawi LimitedMathematical Problems in Engineering1024-123X1563-51472002-01-0184-5283293On fast path-finding algorithms in AND-OR graphsAdelson-Velsky George M.Gelbukh AlexanderLevner Eugene<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="$Oleft( {np} ight),$"> <mrow> <mi>O</mi> <mrow> <mo>(</mo> <mrow> <mi>n</mi> <mi>p</mi> </mrow> <mo>)</mo> </mrow> <mo>,</mo> </mrow> </math> which is superior to the complexity of previously known algorithms.</p> http://www.hindawi.net/access/get.aspx?journal=mpe&volume=8&pii=S1024123X02002004AND-OR graphs; Extremal paths; Scheduling; Routing; Polynomial-time algorithms |
| collection |
DOAJ |
| language |
English |
| format |
Article |
| sources |
DOAJ |
| author |
Adelson-Velsky George M. Gelbukh Alexander Levner Eugene |
| spellingShingle |
Adelson-Velsky George M. Gelbukh Alexander Levner Eugene On fast path-finding algorithms in AND-OR graphs Mathematical Problems in Engineering AND-OR graphs; Extremal paths; Scheduling; Routing; Polynomial-time algorithms |
| author_facet |
Adelson-Velsky George M. Gelbukh Alexander Levner Eugene |
| author_sort |
Adelson-Velsky George M. |
| title |
On fast path-finding algorithms in AND-OR graphs |
| title_short |
On fast path-finding algorithms in AND-OR graphs |
| title_full |
On fast path-finding algorithms in AND-OR graphs |
| title_fullStr |
On fast path-finding algorithms in AND-OR graphs |
| title_full_unstemmed |
On fast path-finding algorithms in AND-OR graphs |
| title_sort |
on fast path-finding algorithms in and-or graphs |
| publisher |
Hindawi Limited |
| series |
Mathematical Problems in Engineering |
| issn |
1024-123X 1563-5147 |
| publishDate |
2002-01-01 |
| description |
<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="$Oleft( {np} ight),$"> <mrow> <mi>O</mi> <mrow> <mo>(</mo> <mrow> <mi>n</mi> <mi>p</mi> </mrow> <mo>)</mo> </mrow> <mo>,</mo> </mrow> </math> which is superior to the complexity of previously known algorithms.</p> |
| topic |
AND-OR graphs; Extremal paths; Scheduling; Routing; Polynomial-time algorithms |
| url |
http://www.hindawi.net/access/get.aspx?journal=mpe&volume=8&pii=S1024123X02002004 |
| work_keys_str_mv |
AT adelsonvelskygeorgem onfastpathfindingalgorithmsinandorgraphs AT gelbukhalexander onfastpathfindingalgorithmsinandorgraphs AT levnereugene onfastpathfindingalgorithmsinandorgraphs |
| _version_ |
1725304114843222016 |