Skip to content
#

hitting-set

Here are 2 public repositories matching this topic...

Language: All
Filter by language

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.

  • Updated Jul 1, 2023
  • Haskell

Improve this page

Add a description, image, and links to the hitting-set topic page so that developers can more easily learn about it.

Curate this topic

Add this topic to your repo

To associate your repository with the hitting-set topic, visit your repo's landing page and select "manage topics."

Learn more