Timeline for Djikstra's algorithm to compute shortest paths using at least k edges
Current License: CC BY-SA 4.0
8 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Apr 9, 2019 at 17:57 | comment | added | lox | if you allow cycles, then you can either replicate the graph $k$ times, or apply some dynamic programming approach. Since you don't, it's NP-complete | |
| Apr 9, 2019 at 17:56 | answer | added | lox | timeline score: 2 | |
| Apr 9, 2019 at 17:52 | comment | added | ryan | @csquestions, if you are not allowed cycles, then this is NP-complete. See this question, specifically the first and last bullet point. Also see last paragraph of this answer to that question. | |
| Apr 9, 2019 at 17:46 | comment | added | cs questions | @John Dvorak the linked problem gave a worst case complexity of 𝑂(𝑘⋅(|𝑉|+|𝐸|)lg|𝐸) and it includes the Hamiltonian Path Problem if k = |V| and there are no paths for k less than this. Am I mistaken? | |
| Apr 9, 2019 at 17:10 | comment | added | John Dvorak | For the PS: yes, it does include Hamiltonian Path Problem as a subproblem. | |
| Apr 9, 2019 at 17:08 | history | edited | cs questions | CC BY-SA 4.0 | added 63 characters in body |
| Apr 9, 2019 at 16:45 | review | First posts | |||
| Apr 10, 2019 at 0:46 | |||||
| Apr 9, 2019 at 16:43 | history | asked | cs questions | CC BY-SA 4.0 |