Lirias (KU Leuven) · 2006 · 43 citations · 15 references
Open access
ComputingComputer ScienceAlgorithmsProgramming LanguagesTheory Of ComputationAlgorithm AnalysisComputational ComplexityConstraint SatisfactionData Structure AlgorithmsData-flow AnalysisShortest Path AlgorithmsConstraint Handling RulesConstraint RulesDijkstra's AlgorithmDijkstra’s Algorithm AnalysisFibonacci Heap AnalysisHeapsSearch Complexity AnalysisShortest Path Problems
We construct a readable, compact and efficient implementation of Dijkstra's shortest path algorithm and Fibonacci heaps using Constraint Handling Rules (CHR), which is increasingly used as a high-level rule-based general-purpose programming language. We measure its performance in different CHR systems, investigating both the theoretical asymptotic complexity and the constant factors realized in practice.
15
A note on two problems in connexion with graphs
E. Dijkstra · Numerische Mathematik · 1959 · 23.8K citations
V. J. Rayward‐Smith, Thomas H. Cormen, Charles E. Leiserson et al. · Journal of the Operational Research Society · 1991 · 17K citations