3 citations · 10 across the 13 of their papers we have counts for
Showing 2024Show all
2 papers · 1 filter
cs.LO2024
A Formal Correctness Proof of Edmonds' Blossom Shrinking Algorithm
Mohammad Abdulaziz, Kurt Mehlhorn
We present the first formal correctness proof of Edmonds' blossom shrinking algorithm for maximum cardinality matching in general graphs. We focus on formalising the mathematical s…
cs.AI2024
Formally Verified Approximate Policy Iteration
Maximilian Schäffeler, Mohammad Abdulaziz
We formally verify an algorithm for approximate policy iteration on Factored Markov Decision Processes using the interactive theorem prover Isabelle/HOL. Next, we show how the form…