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

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Importer (talk | contribs)
Changed an Item
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 68Q25 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 05C40 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 05C70 / rank
 
Normal rank
Property / zbMATH DE Number
 
Property / zbMATH DE Number: 6382134 / rank
 
Normal rank
Property / zbMATH Keywords
 
parameterized complexity
Property / zbMATH Keywords: parameterized complexity / rank
 
Normal rank
Property / zbMATH Keywords
 
connectivity problems
Property / zbMATH Keywords: connectivity problems / rank
 
Normal rank
Property / zbMATH Keywords
 
kernel lower bounds
Property / zbMATH Keywords: kernel lower bounds / rank
 
Normal rank
Property / zbMATH Keywords
 
vertex cover
Property / zbMATH Keywords: vertex cover / rank
 
Normal rank
Property / zbMATH Keywords
 
edge cover
Property / zbMATH Keywords: edge cover / rank
 
Normal rank

Revision as of 19:36, 30 June 2023

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

    Identifiers