Calculating Graph Algorithms for Dominance and Shortest Path

DOI10.1007/978-3-642-31113-0_8zbMath1358.68077OpenAlexW2122427469MaRDI QIDQ2908564

Jan Midtgaard, Ilya Sergey, 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

dominancegraph algorithmsGalois connectionsshortest path algorithmfixed-point calculusfixed-point fusion

Mathematics Subject Classification ID

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

Related Items (2)

Abstract interpretation of graphs ⋮ Constructive Galois Connections

Uses Software

• Galculator

This page was built for publication: Calculating Graph Algorithms for Dominance and Shortest Path