[Back]


Talks and Poster Presentations (with Proceedings-Entry):

L. Kovacs, Hanna Lachnitt, S. Szeider:
"Formalizing Graph Trail Properties in Isabelle/HOL";
Talk: International Conference on Intelligent Computer Mathematics (CICM), Bertinoro, Forli, Italy; 2020-07-26 - 2020-07-31; in: "CICM 2020: Intelligent Computer Mathematics", LNCS, 12236 (2020), ISBN: 978-3-030-53518-6; 190 - 205.



English abstract:
We describe a dataset expressing and proving properties of graph trails, using Isabelle/HOL. We formalize the reasoning about strictly increasing and decreasing trails, using weights over edges, and prove lower bounds over the length of trails in weighted graphs. We do so by extending the graph theory library of Isabelle/HOL with an algorithm computing the length of a longest strictly decreasing graph trail starting from a vertex for a given weight distribution, and prove that any decreasing trail is also an increasing one.


"Official" electronic version of the publication (accessed through its Digital Object Identifier - DOI)
http://dx.doi.org/10.1007/978-3-030-53518-6_12

Electronic version of the publication:
https://publik.tuwien.ac.at/files/publik_292351.pdf


Created from the Publication Database of the Vienna University of Technology.