Complexity issues in vertex-colored graph pattern matching (Q533412): 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: 05C15 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 05C85 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 68Q17 / rank
 
Normal rank
Property / zbMATH DE Number
 
Property / zbMATH DE Number: 5883236 / rank
 
Normal rank
Property / zbMATH Keywords
 
graph motifs
Property / zbMATH Keywords: graph motifs / rank
 
Normal rank
Property / zbMATH Keywords
 
vertex-colored graphs
Property / zbMATH Keywords: vertex-colored graphs / rank
 
Normal rank
Property / zbMATH Keywords
 
algorithmic complexity
Property / zbMATH Keywords: algorithmic complexity / rank
 
Normal rank
Property / zbMATH Keywords
 
parameterized complexity
Property / zbMATH Keywords: parameterized complexity / rank
 
Normal rank

Revision as of 09:24, 1 July 2023

scientific article
Language Label Description Also known as
English
Complexity issues in vertex-colored graph pattern matching
scientific article

    Statements

    Complexity issues in vertex-colored graph pattern matching (English)
    0 references
    0 references
    0 references
    0 references
    3 May 2011
    0 references
    0 references
    0 references
    0 references
    0 references
    graph motifs
    0 references
    vertex-colored graphs
    0 references
    algorithmic complexity
    0 references
    parameterized complexity
    0 references