Efficient algorithms for dualizing large-scale hypergraphs (Q2449091): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Reverse search for enumeration / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3993087 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generating dual-bounded hypergraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms - ESA 2003 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On maximal frequent and minimal infrequent sets in binary matrices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dual-bounded generating problems: Weighted transversals of a hypergraph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computational aspects of monotone dualization: a brief survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Complexity of Dualization of Monotone Disjunctive Normal Forms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lower bounds for three algorithms for transversal hypergraph generation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5431930 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4723784 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Efficient Algorithm for the Transversal Hypergraph Generation / rank
 
Normal rank
Property / cites work
 
Property / cites work: An efficient implementation of a quasi-polynomial algorithm for generating hypergraph transversals and its application in joint generation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Galois Connexions / rank
 
Normal rank
Property / cites work
 
Property / cites work: The worst-case time complexity for generating all maximal cliques and computational experiments / rank
 
Normal rank

Latest revision as of 11:25, 8 July 2024

scientific article
Language Label Description Also known as
English
Efficient algorithms for dualizing large-scale hypergraphs
scientific article

    Statements

    Efficient algorithms for dualizing large-scale hypergraphs (English)
    0 references
    0 references
    0 references
    6 May 2014
    0 references
    dualization
    0 references
    hypergraph transversal
    0 references
    minimal hitting set
    0 references
    minimal set covering
    0 references
    enumeration
    0 references
    experimental efficiency
    0 references
    real-world data
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references