Linear kernelizations for restricted 3-Hitting Set problems (Q989471): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1985829525 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Kernelization Algorithms for d-Hitting Set Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polynomial-time data reduction for dominating set / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3221758 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Problems without Polynomial Kernels (Extended Abstract) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Nondeterminism within $P^ * $ / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved lower bounds on <i>k</i>‐independence / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving large FPT problems on coarse-grained parallel machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parametric Duality and Kernelization: Lower Bounds and Upper Bounds on Kernel Size / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Fractional Covering Number of Hypergraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parameterized and Exact Computation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4393480 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph-Theoretic Concepts in Computer Science / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parametrized complexity theory. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3549693 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Induced Matching Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4180391 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Parameterized Complexity of the Induced Matching Problem in Planar Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parameterized complexity of finding regular induced subgraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Vertex packings: Structural properties and algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5710169 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 03:20, 3 July 2024

scientific article
Language Label Description Also known as
English
Linear kernelizations for restricted 3-Hitting Set problems
scientific article

    Statements

    Linear kernelizations for restricted 3-Hitting Set problems (English)
    0 references
    0 references
    20 August 2010
    0 references
    0 references
    computational complexity
    0 references
    3-Hitting Set problem
    0 references
    kernelization
    0 references
    0 references