On fast path-finding algorithms in AND-OR graphs (Q1886199)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 2115990
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On fast path-finding algorithms in AND-OR graphs |
scientific article; zbMATH DE number 2115990 |
Statements
On fast path-finding algorithms in AND-OR graphs (English)
0 references
16 November 2004
0 references
Summary: 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.
0 references
AND-OR graphs
0 references
Extremal paths
0 references
Scheduling
0 references
Routing
0 references
Polynomial-time algorithms
0 references
0.7588835954666138
0 references
0.7535251975059509
0 references
0.7520899176597595
0 references
