Gabow SCC

swMATH28915MaRDI QIDQ40629FDOQ40629

Author name not available (Why is that?)

Described by source

• Verified Efficient Implementation of Gabow’s Strongly Connected Component Algorithm

Cited In (8)

• Formal verification of an executable LTL model checker with partial order reduction
• Functional correctness of C implementations of Dijkstra's, Kruskal's, and Prim's algorithms
• Refinement to imperative HOL
• Formalizing the Edmonds-Karp Algorithm
• Efficient verified (UN)SAT certificate checking
• From LCF to Isabelle/HOL
• Automatic refinement to efficient data structures: a comparison of two approaches
• Formalizing network flow algorithms: a refinement approach in Isabelle/HOL

This page was built for software: Gabow SCC