Parameterized complexity of generalized domination problems (Q415279): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: On the Boolean-Width of a Graph: Structure and Applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear Time Algorithms for Finding a Dominating Set of Fixed Size in Degenerated Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Faster Algorithms on Branch and Clique Decompositions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dynamic Programming on Tree Decompositions Using Generalised Fast Subset Convolution / rank
 
Normal rank
Property / cites work
 
Property / cites work: Perfect Code is \(W[1]\)-complete / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear time solvable optimization problems on graphs of bounded clique-width / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4027320 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fixed-parameter tractability and completeness II: On completeness for W[1] / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4393480 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Threshold dominating sets and an improved characterization of \(W[2]\) / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Parametrized Complexity of Some Fundamental Problems in Coding Theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parametrized complexity theory. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sort and Search: exact algorithms for generalized domination / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computational Complexity of Generalized Domination: A Complete Dichotomy for Chordal Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generalized Domination in Degenerate Graphs: A Complete Dichotomy of Computational Complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parameterized Complexity of Generalized Domination Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: MOD-2 INDEPENDENCE AND DOMINATION IN GRAPHS / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4209364 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4892794 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4847026 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Grad of a Graph and Classes with Bounded Expansion / rank
 
Normal rank
Property / cites work
 
Property / cites work: First order properties on nowhere dense structures / rank
 
Normal rank
Property / cites work
 
Property / cites work: Grad and classes with bounded expansion. I: Decompositions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Grad and classes with bounded expansion. II: Algorithmic aspects / rank
 
Normal rank
Property / cites work
 
Property / cites work: Grad and classes with bounded expansion. III: Restricted graph homomorphism dualities / rank
 
Normal rank
Property / cites work
 
Property / cites work: On nowhere dense graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5710169 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms for Vertex Partitioning Problems on Partial k-Trees / rank
 
Normal rank

Latest revision as of 05:22, 5 July 2024

scientific article
Language Label Description Also known as
English
Parameterized complexity of generalized domination problems
scientific article

    Statements

    Parameterized complexity of generalized domination problems (English)
    0 references
    0 references
    0 references
    0 references
    11 May 2012
    0 references
    0 references
    generalized domination
    0 references
    parameterized complexity
    0 references
    even set
    0 references
    odd set
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references