Exactly Hittable Interval Graphs
Given a set system $\mathcal{X} = \{\mathcal{U},\mathcal{S}\}$, where $\mathcal{U}$ is a set of elements and $\mathcal{S}$ is a set of subsets of $\mathcal{U}$, an exact hitting set $\mathcal{U}'$ is a subset of $\mathcal{U}$ such that each subset in $\mathcal{S}$ contains exactly one element i...
| Asıl Yazarlar: | , , |
|---|---|
| Materyal Türü: | Makale |
| Dil: | English |
| Baskı/Yayın Bilgisi: |
Discrete Mathematics & Theoretical Computer Science
2023-11-01
|
| Seri Bilgileri: | Discrete Mathematics & Theoretical Computer Science |
| Konular: | |
| Online Erişim: | https://dmtcs.episciences.org/10762/pdf |