References in zbMATH (referenced in 39 articles )

Showing results 1 to 20 of 39.
Sorted by year (citations)

1 2 next

  1. Potter, Samuel F.; Cameron, Maria K.: Ordered line integral methods for solving the eikonal equation (2019)
  2. Takaoka, Tadao: Algebraic theory on shortest paths for all flows (2019)
  3. Böhmová, Kateřina; Häfliger, Luca; Mihalák, Matúš; Pröger, Tobias; Sacomoto, Gustavo; Sagot, Marie-France: Computing and listing (st)-paths in public transportation networks (2018)
  4. Dinitz, Yefim; Itzhak, Rotem: Hybrid Bellman-Ford-Dijkstra algorithm (2017)
  5. Böhmová, Kateřina; Mihalák, Matúš; Pröger, Tobias; Sacomoto, Gustavo; Sagot, Marie-France: Computing and listing (st)-paths in public transportation networks (2016)
  6. Michalopoulos, Dennis P.; Barnes, J. Wesley; Morton, David P.: Prioritized interdiction of nuclear smuggling via tabu search (2015)
  7. Takaoka, Tadao: Algebraic theory on shortest paths for all flows (2015)
  8. Takaoka, Tadao: Single source shortest paths for all flows with integer costs (2015)
  9. Takei, R.; Chen, W.; Clawson, Z.; Kirov, S.; Vladimirsky, A.: Optimal control with budget constraints and resets (2015)
  10. Takaoka, Tadao: Sharing information for the all pairs shortest path problem (2014)
  11. Delling, Daniel; Goldberg, Andrew V.; Nowatzyk, Andreas; Werneck, Renato F.: PHAST: hardware-accelerated shortest path trees (2013) ioport
  12. Alton, Ken; Mitchell, Ian M.: An ordered upwind method with precomputed stencil and monotone node acceptance for solving static convex Hamilton-Jacobi equations (2012)
  13. Duan, Ran; Su, Hsin-Hao: A scaling algorithm for maximum weight matching in bipartite graphs (2012)
  14. Edelkamp, S.; Sulewski, D.; Barnat, J.; Brim, L.; Šimeček, P.: Flash memory efficient LTL model checking (2011)
  15. Babenko, Maxim A.: A fast algorithm for the path 2-packing problem (2010)
  16. Ebendt, Rüdiger; Drechsler, Rolf: Weighted (A^*) search - unifying view and application (2009)
  17. Ziliaskopoulos, Athanasios K.; Mandanas, Fotios D.; Mahmassani, Hani S.: An extension of labeling techniques for finding shortest path trees (2009)
  18. Nannicini, Giacomo; Liberti, Leo: Shortest paths on dynamic graphs (2008)
  19. Vladimirsky, Alexander: Label-setting methods for multimode stochastic shortest path problems on graphs (2008)
  20. Xu, M. H.; Liu, Y. Q.; Huang, Q. L.; Zhang, Y. X.; Luan, G. F.: An improved Dijkstra’s shortest path algorithm for sparse network (2007)

1 2 next