On the dualization of hypergraphs with bounded edge-intersections and other related classes of hypergraphs (Q2381526): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: A fast and simple randomized parallel algorithm for the maximal independent set problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3138895 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3993087 / 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: Dual subimplicants of positive Boolean functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Orbits of antichains revisited / rank
 
Normal rank
Property / cites work
 
Property / cites work: An efficient parallel algorithm for computing a maximal independent set in a hypergraph of dimension 3 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3211359 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient read-restricted monotone CNF/DNF dualization by learning with membership queries / 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: New results on monotone dualization and generating hypergraph transversals / rank
 
Normal rank
Property / cites work
 
Property / cites work: Orbits of antichains in ranked posets / 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: A simple NC-algorithm for a maximal independent set in a hypergraph of poly-log arboricity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Constructing a Maximal Independent Set in Parallel / rank
 
Normal rank
Property / cites work
 
Property / cites work: A New Parallel Algorithm for the Maximal Independent Set Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4766839 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On generating all maximal independent sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: A fast parallel algorithm for the maximal independent set problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of parallel search / 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 Parallel Randomized Algorithm for Finding a Maximal Independent Set in a Linear Hypergraph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3997892 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A New Algorithm for Generating All the Maximal Independent Sets / rank
 
Normal rank

Latest revision as of 15:41, 26 June 2024

scientific article
Language Label Description Also known as
English
On the dualization of hypergraphs with bounded edge-intersections and other related classes of hypergraphs
scientific article

    Statements

    On the dualization of hypergraphs with bounded edge-intersections and other related classes of hypergraphs (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    18 September 2007
    0 references
    0 references
    Bounded degree
    0 references
    bounded dimension
    0 references
    conformal hypergraph
    0 references
    dualization
    0 references
    incremental generating
    0 references
    maximal independent set
    0 references
    minimal transversal
    0 references
    polynomial space
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references