2026-07-21T11:21:29Z https://drops.dagstuhl.de/oai

oai:drops-oai.dagstuhl.de:10945 2024-03-06T10:46:53Z ddc:004 open_access

Trustworthy Graph Algorithms (Invited Talk) Abdulaziz, Mohammad Mehlhorn, Kurt Nipkow, Tobias graph algorithms formal correct proofs Isabelle LEDA certifying algorithms The goal of the LEDA project was to build an easy-to-use and extendable library of correct and efficient data structures, graph algorithms and geometric algorithms. We report on the use of formal program verification to achieve an even higher level of trustworthiness. Specifically, we report on an ongoing and largely finished verification of the blossom-shrinking algorithm for maximum cardinality matching. Schloss Dagstuhl – Leibniz-Zentrum für Informatik Mohammad Abdulaziz and Kurt Mehlhorn and Tobias Nipkow 2019 Is Part Of LIPIcs, Volume 138, 44th International Symposium on Mathematical Foundations of Computer Science (MFCS 2019) InProceedings Text doc-type:ResearchArticle publishedVersion application/pdf doi:10.4230/LIPIcs.MFCS.2019.1 urn:nbn:de:0030-drops-109456 https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2019.1 eng https://creativecommons.org/licenses/by/3.0/legalcode