@online{Abdulaziz_arXiv1907.04065,
TITLE = {Trustworthy Graph Algorithms},
AUTHOR = {Abdulaziz, Mohammad and Mehlhorn, Kurt and Nipkow, Tobias},
LANGUAGE = {eng},
URL = {http://arxiv.org/abs/1907.04065},
EPRINT = {1907.04065},
EPRINTTYPE = {arXiv},
YEAR = {2019},
ABSTRACT = {The goal of the LEDA project was to build an easy-to-use and extendable<br>library of correct and efficient data structures, graph algorithms and<br>geometric algorithms. We report on the use of formal program verification to<br>achieve an even higher level of trustworthiness. Specifically, we report on an<br>ongoing and largely finished verification of the blossom-shrinking algorithm<br>for maximum cardinality matching.<br>},
}