Subexponential Fixed-Parameter Algorithms for Partial Vector Domination (Q3195339): Difference between revisions

From MaRDI portal
Added link to MaRDI 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 / OpenAlex ID
 
Property / OpenAlex ID: W419104854 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Implicit branching and parameterized partial cover problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: On bounded-degree vertex deletion parameterized by treewidth / rank
 
Normal rank
Property / cites work
 
Property / cites work: Constructive linear time algorithms for branchwidth / rank
 
Normal rank
Property / cites work
 
Property / cites work: Latency-Bounded Target Set Selection in Social Networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hardness, Approximability, and Exact Algorithms for Vector Domination and Total Vector Domination in Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the approximability and exact algorithms for vector domination and related problems in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Relationship Between Clique-Width and Treewidth / rank
 
Normal rank
Property / cites work
 
Property / cites work: The monadic second-order logic of graphs. I: Recognizable sets of finite graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fixed-parameter algorithms for ( <i>k</i> , <i>r</i> )-center in planar graphs and map graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2921717 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dynamic Programming and Fast Matrix Multiplication / rank
 
Normal rank
Property / cites work
 
Property / cites work: Subexponential algorithms for partial cover problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dominating Sets in Planar Graphs: Branch-Width and Exponential Speed-Up / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Dominating Sets and Independent Sets of Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4552196 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4368729 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4368728 / rank
 
Normal rank
Property / cites work
 
Property / cites work: (Total) Vector Domination for Graphs with Bounded Branchwidth / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parameterized Algorithms for Generalized Domination / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph minors. X: Obstructions to tree-decomposition / rank
 
Normal rank
Property / cites work
 
Property / cites work: Call routing and the ratcatcher / rank
 
Normal rank

Latest revision as of 22:44, 10 July 2024

scientific article
Language Label Description Also known as
English
Subexponential Fixed-Parameter Algorithms for Partial Vector Domination
scientific article

    Statements

    Subexponential Fixed-Parameter Algorithms for Partial Vector Domination (English)
    0 references
    0 references
    0 references
    0 references
    16 October 2015
    0 references

    Identifiers

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