Complexity issues in vertex-colored graph pattern matching (Q533412): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(4 intermediate revisions by 4 users not shown)
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
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.jda.2010.09.002 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2086133268 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Color-coding / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parameterized Algorithms and Hardness Results for Some Graph Motif Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fourier meets M\"{o}bius: fast subset convolution / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity results on restricted instances of a paint shop problem for words / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3651735 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Maximum Motif Problem in Vertex-Colored Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4393480 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sharp Tractability Borderlines for Finding Connected Motifs in Vertex-Colored Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Analogs & duals of the MAST problem for sequences & trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parametrized complexity theory. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parameterized Complexity and Approximability of the SLCS Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5572939 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the complexity of comparing evolutionary trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity results on a paint shop problem. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithm engineering for color-coding with applications to signaling pathway detection / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Approximation of Shortest Common Supersequences and Longest Common Subsequences / rank
 
Normal rank
Property / cites work
 
Property / cites work: Research in Computational Molecular Biology / rank
 
Normal rank
Property / cites work
 
Property / cites work: An $O(n\log ^2 n)$ Algorithm for the <i>k</i>th Longest Path in a Tree with Applications to Location Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5710169 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimization, approximation, and complexity classes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Non deterministic polynomial optimization problems and their approximations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4527015 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 00:55, 4 July 2024

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
    0 references