Deterministic parameterized algorithms for the graph motif problem (Q313814): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Color-coding / 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: Narrow sieves for parameterized paths and packings / 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: Upper and lower bounds for finding connected motifs in vertex-colored graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Representative Sets of Product Families / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient Computation of Representative Sets with Applications in Parameterized and Exact Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding and counting vertex-colored subtrees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Constrained multilinear detection for faster functional motif discovery / rank
 
Normal rank
Property / cites work
 
Property / cites work: Deterministic Truncation of Linear Matroids / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5484515 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Partial information network queries / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms for topology-free and alignment network queries / 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: Representative Families: A Unified Tradeoff-Based Approach / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multiplying matrices faster than coppersmith-winograd / rank
 
Normal rank

Latest revision as of 13:24, 12 July 2024

scientific article
Language Label Description Also known as
English
Deterministic parameterized algorithms for the graph motif problem
scientific article

    Statements

    Deterministic parameterized algorithms for the graph motif problem (English)
    0 references
    0 references
    0 references
    0 references
    12 September 2016
    0 references
    parameterized algorithm
    0 references
    graph motif
    0 references
    representative family
    0 references
    guiding tree
    0 references

    Identifiers