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

From MaRDI portal
Normalize DOI.
Normalize DOI.
 
Property / DOI
 
Property / DOI: 10.1016/J.TCS.2014.10.035 / 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