Dijkstra’s algorithm with Fibonacci heaps: An executable description

Dijkstra’s algorithm with Fibonacci heaps: An executable description (2006)

by Jon Sneyers , Tom Schrijvers , Bart Demoen

Venue:	in CHR. In 20th Workshop on Logic Programming (WLP’06
Citations:	17 - 11 self

Datum	Value	Source
TITLE	Dijkstra’s algorithm with Fibonacci heaps: An executable description	INFERENCE
AUTHOR NAME	Jon Sneyers	SVM HeaderParse 0.2
AUTHOR AFFIL	Dept. of Computer Science	SVM HeaderParse 0.2
AUTHOR ADDR	K.U.Leuven, Belgium	SVM HeaderParse 0.2
AUTHOR NAME	Tom Schrijvers	SVM HeaderParse 0.2
AUTHOR AFFIL	Dept. of Computer Science	SVM HeaderParse 0.2
AUTHOR ADDR	K.U.Leuven, Belgium	SVM HeaderParse 0.2
AUTHOR NAME	Bart Demoen	SVM HeaderParse 0.2
AUTHOR AFFIL	Dept. of Computer Science	SVM HeaderParse 0.2
AUTHOR ADDR	K.U.Leuven, Belgium	SVM HeaderParse 0.2
ABSTRACT	Abstract. 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. 1	SVM HeaderParse 0.2
YEAR	2006	INFERENCE
VENUE	in CHR. In 20th Workshop on Logic Programming (WLP’06	INFERENCE
VENUE TYPE	CONFERENCE	INFERENCE
PAGES	182--191	INFERENCE
CITATIONS	25 found	ParsCit 1.0