A generalization of Dijkstra's algorithm

DOI10.1016/0020-0190(77)90002-3MaRDI QIDQ1240557zbMATH OpenOpenAlexDBLPWikidataFDO

Authors Donald E. Knuth

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

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Algorithms in computer science (68W99)

Cites work

• scientific article; zbMATH DE number 1178976 (Why is no real title available?)
• A note on two problems in connexion with graphs
• On AFL generators for finitely encoded AFA
• Optimal Code Generation for Expression Trees

Cited in

(26)

• Vertex labeling and routing for Farey-type symmetrically-structured graphs
• Partially dynamic maintenance of minimum weight hyperpaths
• A note on the complexity of comparing succinctly represented integers, with an application to maximum probability parsing
• The tree longest detour problem in a biconnected graph.
• An efficient best-trees algorithm for weighted tree automata over the tropical semiring
• Weighted Deductive Parsing and Knuth's Algorithm
• Finding the \(N\) best vertices in an infinite weighted hypergraph
• Bottom-up unranked tree-to-graph transducers for translation into semantic graphs
• Weighted online minimum latency problem with edge uncertainty
• 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 hybrid solution method for the bi-objective traffic counting location problem using previous origin-destination trip tables
• A pruning feedforward small-world neural network based on Katz centrality for nonlinear system modeling
• Table design in dynamic programming
• Efficient enumeration of weighted tree languages over the tropical semiring
• Dijkstra's algorithm for solving the shortest path problem on networks under intuitionistic fuzzy environment
• Polynomial Precise Interval Analysis Revisited
• Grammar semantics, analysis and parsing by abstract interpretation
• Directed hypergraphs: introduction and fundamental algorithms -- a survey
• Hybrid Bellman-Ford-Dijkstra algorithm
• Graph-based algorithms for the efficient solution of optimization problems involving monotone functions
• Regular algebra applied to language problems
• On the expected behaviors of the Dijkstra's shortest path algorithm for complete graphs
• A general heuristic bottom-up procedure for searching AND/OR graphs
• Linear connectivity problems in directed hypergraphs
• Formal language constrained path problems

This page was built for publication: A generalization of Dijkstra's algorithm

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1240557)