English
 
User Manual Privacy Policy Disclaimer Contact us
  Advanced SearchBrowse

Item

ITEM ACTIONSEXPORT

Released

Paper

Trustworthy Graph Algorithms

MPS-Authors
/persons/resource/persons45021

Mehlhorn,  Kurt
Algorithms and Complexity, MPI for Informatics, Max Planck Society;

External Ressource
No external resources are shared
Fulltext (public)

arXiv:1907.04065.pdf
(Preprint), 679KB

Supplementary Material (public)
There is no public supplementary material available
Citation

Abdulaziz, M., Mehlhorn, K., & Nipkow, T. (2019). Trustworthy Graph Algorithms. Retrieved from http://arxiv.org/abs/1907.04065.


Cite as: http://hdl.handle.net/21.11116/0000-0005-4FA8-6
Abstract
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.