A generalization of Dijkstra's algorithm
From MaRDI portal
Publication:1240557
DOI10.1016/0020-0190(77)90002-3zbMath0363.68056OpenAlexW1975638108WikidataQ29393236 ScholiaQ29393236MaRDI QIDQ1240557
Publication date: 1977
Published in: Information Processing Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0020-0190(77)90002-3
Related Items (26)
Finding the \(N\) best vertices in an infinite weighted hypergraph ⋮ Formal language constrained path problems ⋮ A general heuristic bottom-up procedure for searching AND/OR graphs ⋮ Dijkstra's algorithm for solving the shortest path problem on networks under intuitionistic fuzzy environment ⋮ A Note on the Complexity of Comparing Succinctly Represented Integers, with an Application to Maximum Probability Parsing ⋮ Weighted Deductive Parsing and Knuth's Algorithm ⋮ Graph-based algorithms for the efficient solution of optimization problems involving monotone functions ⋮ A hybrid solution method for the bi-objective traffic counting location problem using previous origin-destination trip tables ⋮ Efficient enumeration of weighted tree languages over the tropical semiring ⋮ The tree longest detour problem in a biconnected graph. ⋮ Grammar semantics, analysis and parsing by abstract interpretation ⋮ Weighted online minimum latency problem with edge uncertainty ⋮ Directed hypergraphs: introduction and fundamental algorithms -- a survey ⋮ Hybrid Bellman-Ford-Dijkstra algorithm ⋮ Partially dynamic maintenance of minimum weight hyperpaths ⋮ Bottom-up unranked tree-to-graph transducers for translation into semantic graphs ⋮ Table design in dynamic programming ⋮ An Efficient Best-Trees Algorithm for Weighted Tree Automata over the Tropical Semiring ⋮ On the expected behaviors of the Dijkstra's shortest path algorithm for complete graphs ⋮ The price of optimum in Stackelberg games on arbitrary single commodity networks and latency functions ⋮ Weighted parsing for grammar-based language models over multioperator monoids ⋮ A pruning feedforward small-world neural network based on Katz centrality for nonlinear system modeling ⋮ Polynomial Precise Interval Analysis Revisited ⋮ Linear connectivity problems in directed hypergraphs ⋮ Vertex labeling and routing for Farey-type symmetrically-structured graphs ⋮ Regular algebra applied to language problems
Cites Work
This page was built for publication: A generalization of Dijkstra's algorithm
