Calculating graph algorithms for dominance and shortest path

DOI10.1007/978-3-642-31113-0_8MaRDI QIDQ2908564zbMATH OpenOpenAlexFDO

Authors Ilya Sergey, Jan Midtgaard, Dave Clarke

Publication date 5 September 2012

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-31113-0_8

zbMATH Keywords

dominancefixed-point calculusfixed-point fusionGalois connectionsgraph algorithmsshortest path algorithm

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Galois correspondences, closure operators (in relation to ordered sets) (06A15) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30) Graph theory (including graph drawing) in computer science (68R10)

Recommendations

• Calculating path algorithms
• scientific article; zbMATH DE number 512950
• scientific article; zbMATH DE number 4147534
• scientific article; zbMATH DE number 512947
• A walk over the shortest path: Dijkstra's algorithm viewed as fixed-point computation.

Cited in

(4)

• Calculating path algorithms
• scientific article; zbMATH DE number 512950 (Why is no real title available?)
• Constructive Galois connections
• Abstract interpretation of graphs

Describes a project that uses

Uses Software

• Galculator

This page was built for publication: Calculating graph algorithms for dominance and shortest path

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