A new technique breaks Dijkstra's 70-year-old record: it finds routes faster in huge networks, changing graph theory forever.
In this paper, a strongly polynomial algorithm is suggested for solving the AND-OR graphs with zero-length cycles. Its complexity is O(p'p) where p' is of arcs entering the AND-nodes and p is the ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results
Feedback