Finding approximate and constrained motifs in graphs (Q390871): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
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.tcs.2012.08.023 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2152084501 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Kernelization Complexity of Colorful Motifs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some APX-completeness results for cubic graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Color-coding / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Turing way to parameterized complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity issues in vertex-colored graph pattern matching / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding Approximate and Constrained Motifs in Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4393480 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Upper and lower bounds for finding connected motifs in vertex-colored graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding and counting vertex-colored subtrees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5710169 / 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: Some Results on more Flexible Versions of Graph Motif / rank
 
Normal rank
Property / cites work
 
Property / cites work: Research in Computational Molecular Biology / rank
 
Normal rank
Property / cites work
 
Property / cites work: Collective dynamics of ‘small-world’ networks / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 04:34, 7 July 2024

scientific article
Language Label Description Also known as
English
Finding approximate and constrained motifs in graphs
scientific article

    Statements

    Finding approximate and constrained motifs in graphs (English)
    0 references
    0 references
    0 references
    0 references
    9 January 2014
    0 references
    graph motif
    0 references
    computational biology
    0 references
    parameterized complexity
    0 references
    algorithms
    0 references
    computational complexity
    0 references
    biological networks
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references