Shortest path problem: Difference between revisions

Content deleted Content added
Directed graph: | Alter: template type. Add: class, eprint. Removed parameters. Some additions/deletions were parameter name changes. | Use this tool. Report bugs. | #UCB_Gadget
Line 81:
| <math>\mathbb{R}</math> || [[Dijkstra's algorithm]] with [[Fibonacci heap]]||<math>O(E+V\log{V})</math> || {{harvnb|Fredman|Tarjan|1984}}, {{harvnb|Fredman|Tarjan|1987}}
|-
| <math>\mathbb{R}</math> || Quantum [[Dijkstra algorithm]] with adjacency list ||<math>O(\sqrt{VE}\log^2{V})</math> || Dürr et al. 2006<ref>{{Cite journal |last1=DurrDürr |first1=Christoph |last2=Heiligman |first2=Mark |last3=HoyerHøyer |first3=Peter |last4=Mhalla |first4=Mehdi |date=January 2006 |title=Quantum query complexity of some graph problems |journal=SIAM Journal on Computing |volume=35 |issue=6 |pages=1310–1328 |doi=10.1137/050644719 |arxiv=quant-ph/0401091 |s2cid=14253494 |issn=0097-5397}}</ref>
|-
| <math>\mathbb{N}</math> || Dial's algorithm<ref name="dial69">{{cite journal