Pages that link to "Item:Q1240557"

The following pages link to A generalization of Dijkstra's algorithm (Q1240557):

Displaying 26 items.

• Dijkstra's algorithm for solving the shortest path problem on networks under intuitionistic fuzzy environment (Q359406) (← links)
• Directed hypergraphs: introduction and fundamental algorithms -- a survey (Q507517) (← links)
• Hybrid Bellman-Ford-Dijkstra algorithm (Q511150) (← links)
• Grammar semantics, analysis and parsing by abstract interpretation (Q655410) (← links)
• Regular algebra applied to language problems (Q817577) (← links)
• The price of optimum in Stackelberg games on arbitrary single commodity networks and latency functions (Q1006047) (← links)
• Linear connectivity problems in directed hypergraphs (Q1029330) (← links)
• On the expected behaviors of the Dijkstra's shortest path algorithm for complete graphs (Q1254332) (← links)
• The tree longest detour problem in a biconnected graph. (Q1427585) (← links)
• Partially dynamic maintenance of minimum weight hyperpaths (Q1775013) (← links)
• Bottom-up unranked tree-to-graph transducers for translation into semantic graphs (Q2029483) (← links)
• Weighted parsing for grammar-based language models over multioperator monoids (Q2051800) (← links)
• A pruning feedforward small-world neural network based on Katz centrality for nonlinear system modeling (Q2057709) (← links)
• Weighted online minimum latency problem with edge uncertainty (Q2239843) (← links)
• Vertex labeling and routing for Farey-type symmetrically-structured graphs (Q2333775) (← links)
• Finding the \(N\) best vertices in an infinite weighted hypergraph (Q2358678) (← links)
• Graph-based algorithms for the efficient solution of optimization problems involving monotone functions (Q2419542) (← links)
• Efficient enumeration of weighted tree languages over the tropical semiring (Q2424678) (← links)
• Table design in dynamic programming (Q2509355) (← links)
• A general heuristic bottom-up procedure for searching AND/OR graphs (Q2639647) (← links)
• An Efficient Best-Trees Algorithm for Weighted Tree Automata over the Tropical Semiring (Q2799165) (← links)
• A Note on the Complexity of Comparing Succinctly Represented Integers, with an Application to Maximum Probability Parsing (Q2943574) (← links)
• Weighted Deductive Parsing and Knuth's Algorithm (Q3225400) (← links)
• Polynomial Precise Interval Analysis Revisited (Q3644736) (← links)
• Formal language constrained path problems (Q5054859) (← links)
• A hybrid solution method for the bi-objective traffic counting location problem using previous origin-destination trip tables (Q6088551) (← links)