Combinatorics for smaller kernels: the differential of a graph (Q476877): 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: 05C85 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 68W25 / rank
 
Normal rank
Property / zbMATH DE Number
 
Property / zbMATH DE Number: 6375987 / rank
 
Normal rank
Property / zbMATH Keywords
 
parameterized algorithm
Property / zbMATH Keywords: parameterized algorithm / rank
 
Normal rank
Property / zbMATH Keywords
 
kernelization
Property / zbMATH Keywords: kernelization / rank
 
Normal rank
Property / zbMATH Keywords
 
approximation algorithm
Property / zbMATH Keywords: approximation algorithm / rank
 
Normal rank
Property / zbMATH Keywords
 
combinatorial bounds
Property / zbMATH Keywords: combinatorial bounds / rank
 
Normal rank
Property / zbMATH Keywords
 
differential of a graph
Property / zbMATH Keywords: differential of a graph / rank
 
Normal rank

Revision as of 18:11, 30 June 2023

scientific article
Language Label Description Also known as
English
Combinatorics for smaller kernels: the differential of a graph
scientific article

    Statements

    Combinatorics for smaller kernels: the differential of a graph (English)
    0 references
    0 references
    0 references
    2 December 2014
    0 references
    parameterized algorithm
    0 references
    kernelization
    0 references
    approximation algorithm
    0 references
    combinatorial bounds
    0 references
    differential of a graph
    0 references

    Identifiers