On the parameterized complexity of vertex cover and edge cover with connectivity constraints (Q482281): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
Normalize DOI.
 
(2 intermediate revisions by 2 users not shown)
Property / DOI
 
Property / DOI: 10.1016/j.tcs.2014.10.035 / rank
Normal rank
 
Property / cites work
 
Property / cites work: The Curse of Connectivity: t-Total Vertex (Edge) Cover / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reducibility among Combinatorial Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved upper bounds for vertex cover / rank
 
Normal rank
Property / cites work
 
Property / cites work: Vertex Cover: Further Observations and Further Improvements / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Multiway Cut Parameterized above Lower Bounds / rank
 
Normal rank
Property / cites work
 
Property / cites work: Paths, Flowers and Vertex Cover / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2904774 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Algorithm for a Minimum Cover of a Graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Vertex and edge covers with clustering properties: Complexity and algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the completeness of a generalized matching problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parallel Processing and Applied Mathematics / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation algorithms for the test cover problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: The number of trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Color-coding / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4349924 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5710169 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parametrized complexity theory. / rank
 
Normal rank
Property / cites work
 
Property / cites work: On problems without polynomial kernels / rank
 
Normal rank
Property / cites work
 
Property / cites work: Kernel Bounds for Disjoint Cycles and Disjoint Paths / rank
 
Normal rank
Property / cites work
 
Property / cites work: Incompressibility through Colors and IDs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / 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: Deterministic Parameterized Connected Vertex Cover / rank
 
Normal rank
Property / cites work
 
Property / cites work: Constant Time Generation of Rooted Trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Counting Subgraphs via Homomorphisms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4231923 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast algorithms for genegrating integer partitions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2747613 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Counting Subgraphs via Homomorphisms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Edge Dominating Sets in Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: New Parameterized Algorithms for the Edge Dominating Set Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2908840 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parameterized measure \& conquer for problems with no small kernels / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1016/J.TCS.2014.10.035 / rank
 
Normal rank

Latest revision as of 18:49, 9 December 2024

scientific article
Language Label Description Also known as
English
On the parameterized complexity of vertex cover and edge cover with connectivity constraints
scientific article

    Statements

    On the parameterized complexity of vertex cover and edge cover with connectivity constraints (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    22 December 2014
    0 references
    parameterized complexity
    0 references
    connectivity problems
    0 references
    kernel lower bounds
    0 references
    vertex cover
    0 references
    edge cover
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers