coq-club AT inria.fr
Subject: The Coq mailing list
List archive
- From: Piotr Rudnicki <piotr AT cs.ualberta.ca>
- To: QED-like <qed AT mcs.anl.gov>, coq-club AT pauillac.inria.fr, info-hol AT phirewall.cs.byu.edu, isabelle-users AT cl.cam.ac.uk, imps AT hygelac.cas.mcmaster.ca, nuprllist AT cs.cornell.edu, pvs AT csl.sri.com, nqthm-users AT cs.utexas.edu, nuprl AT cs.cornell.edu
- Subject: [Coq-Club] Graph algorithms
- Date: Fri, 7 May 2004 14:14:53 -0600
- List-archive: <http://pauillac.inria.fr/pipermail/coq-club/>
Hi:
Has anybody formalized in any system graph algorithms like: Dijkstra shortest
path, Prim's MST or Ford-Fulkerson network flow?
Gilbert Lee from here has just finished formalizing these algorithms
in Mizar (at the level of graph operations) and we would like to know
who else has possibly done something similar.
Thanks and best,
--
Piotr Rudnicki CompSci, University of Alberta, Edmonton, Canada
http://web.cs.ualberta.ca/~piotr
- [Coq-Club] Graph algorithms, Piotr Rudnicki
- [Coq-Club] Re: Graph algorithms, J Strother Moore
- [Coq-Club] Re: Graph algorithms, Masami Hagiya
Archive powered by MhonArc 2.6.16.