andreyomatveev/hitting-set

A Haskell HittingSetModule.hs module exporting a function that finds the lexicographically minimal blocking set, of minimum cardinality, of a family of sets of integers. In the spirit of Theorem 9.12(ii) and Example 9.13 from the monograph A.O. Matveev, Symmetric Cycles, Jenny Stanford Publishing, 2023.

Language: Haskell - Size: 75.2 KB - Last synced at: over 2 years ago - Pushed at: almost 3 years ago - Stars: 0 - Forks: 0