Beyond Hypergraph Dualization

Abstract : This problem concerns hypergraph dualization and generalization to poset dualization. A hypergraph H = (V, E) consists of a finite collection E of sets over a finite set V , i.e. E ⊆ P(V) (the powerset of V). The elements of E are called hyperedges, or simply edges. A hypergraph is said simple if none of its edges is contained within another. A transversal (or hitting set) of H is a set T ⊆ V that intersects every edge of E. A transversal is minimal if it does not contain any other transversal as a subset. The set of all minimal transversal of H is denoted by T r(H). The hypergraph (V, T r(H)) is called the transversal hypergraph of H. Given a simple hypergraph H, the hypergraph dualization problem (Trans-Enum for short) concerns the enumeration without repetitions of T r(H). The Trans-Enum problem can also be formulated as a dualization problem in posets. Let (P, ≤) be a poset (i.e. ≤ is a reflexive, antisymmetric, and transitive relation on the set P). For A ⊆ P , ↓ A (resp. ↑ A) is the downward (resp. upward) closure of A under the relation ≤ (i.e. ↓ A is an ideal and ↑ A a filter of (P, ≤)). Two antichains (B + , B −) of P are said to be dual if ↓ B + ∪ ↑ B − = P and ↓ B + ∩ ↑ B − = ∅. Given an implicit description of a poset P and an antichain B + (resp. B −) of P , the poset dualization problem (Dual-Enum for short) enumerates the set B − (resp. B +), denoted by Dual(B +) = B − (resp. Dual(B −) = B +). Notice that the function dual is self-dual or idempotent, i.e. Dual(Dual(B)) = B.
Document type :
Book sections
Complete list of metadatas

https://hal.archives-ouvertes.fr/hal-01229015
Contributor : Jean Marc Petit <>
Submitted on : Monday, November 16, 2015 - 10:02:12 AM
Last modification on : Tuesday, February 26, 2019 - 4:07:32 PM
Long-term archiving on : Friday, April 28, 2017 - 4:19:59 PM

File

2015 Encyclopedy-Dualization.p...
Files produced by the author(s)

Identifiers

Citation

Lhouari Nourine, Jean-Marc Petit. Beyond Hypergraph Dualization. Springer. Encyclopedia of Algorithms, pp.189-192, 2016, ⟨10.1007/978-3-642-27848-8_719-1⟩. ⟨http://link.springer.com/referenceworkentry/10.1007/978-3-642-27848-8_719-1⟩. ⟨hal-01229015⟩

Share

Metrics

Record views

392

Files downloads

233