Calculating graph algorithms for dominance and shortest path

Ilya Sergey, Jan Midtgaard, Dave Clarke

Publikation: Kapitel i bog/rapport/konference-proceedingKonferencebidrag i proceedingsForskningpeer review

Abstrakt

We calculate two iterative, polynomial-time graph algorithms from the literature: a dominance algorithm and an algorithm for the single-source shortest path problem. Both algorithms are calculated directly from the definition of the properties by fixed-point fusion of (1) a least fixed point expressing all finite paths through a directed graph and (2) Galois connections that capture dominance and path length. The approach illustrates that reasoning in the style of fixed-point calculus extends gracefully to the domain of graph algorithms. We thereby bridge common practice from the school of program calculation with common practice from the school of static program analysis, and build a novel view on iterative graph algorithms as instances of abstract interpretation.

OriginalsprogEngelsk
TitelMathematics of Program Construction - 11th International Conference, MPC 2012, Proceedings
RedaktørerJeremy Gibbons, Pablo Nogueira
Antal sider25
ForlagSpringer VS
Publikationsdato1. jan. 2012
Sider132-156
ISBN (Trykt)9783642311123
StatusUdgivet - 1. jan. 2012
Begivenhed11th International Conference on Mathematics of Program Construction, MPC 2012 - Madrid, Spanien
Varighed: 25. jun. 201227. jun. 2012

Konference

Konference11th International Conference on Mathematics of Program Construction, MPC 2012
LandSpanien
ByMadrid
Periode25/06/201227/06/2012
NavnLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Vol/bind7342 LNCS
ISSN0302-9743

Fingeraftryk Dyk ned i forskningsemnerne om 'Calculating graph algorithms for dominance and shortest path<sup>⋆</sup>'. Sammen danner de et unikt fingeraftryk.

Citationsformater