An efficient implementation of a quasi-polynomial algorithm for generating hypergraph transversals and its application in joint generation (Q860396): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.dam.2006.04.012 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2012628629 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4004178 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity of identification and dualization of positive Boolean functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generating dual-bounded hypergraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Integer Programming and Combinatorial Optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dual-Bounded Generating Problems: All Minimal Integer Solutions for a Monotone System of Linear Inequalities / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4449202 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dual-Bounded Generating Problems: Partial and Multiple Transversals of a Hypergraph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4736834 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing the Largest Empty Rectangle / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4473270 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Identifying the Minimal Transversals of a Hypergraph and Related Problems / 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: Q4766839 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On generating the irredundant conjunctive and disjunctive normal forms of monotone Boolean functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generating All Maximal Independent Sets: NP-Hardness and Polynomial-Time Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new algorithm for the largest empty rectangle problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Every one a Winner or how to Avoid Isomorphism Search when Cataloguing Combinatorial Configurations / rank
 
Normal rank

Latest revision as of 12:05, 25 June 2024

scientific article
Language Label Description Also known as
English
An efficient implementation of a quasi-polynomial algorithm for generating hypergraph transversals and its application in joint generation
scientific article

    Statements

    An efficient implementation of a quasi-polynomial algorithm for generating hypergraph transversals and its application in joint generation (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    9 January 2007
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    dualization
    0 references
    hypergraph transversals
    0 references
    generation algorithms
    0 references
    monotone properties
    0 references
    frequent sets
    0 references
    empty boxes
    0 references
    0 references