Upper and lower bounds for finding connected motifs in vertex-colored graphs (Q716314): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
Created claim: DBLP publication ID (P1635): journals/jcss/FellowsFHV11, #quickstatements; #temporary_batch_1731475607626
 
(4 intermediate revisions by 4 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / Wikidata QID
 
Property / Wikidata QID: Q57359721 / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.jcss.2010.07.003 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2018472652 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Color-coding / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximating the Interval Constrained Coloring Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient algorithms for combinatorial problems on graphs with bounded decomposability - a survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity of Finding Embeddings in a <i>k</i>-Tree / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear time algorithms for NP-hard problems restricted to partial k- trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: A linear-time algorithm for testing the truth of certain quantified Boolean formulas / 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: Q4291429 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Linear-Time Algorithm for Finding Tree-Decompositions of Small Treewidth / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4699283 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On intervalizing \(k\)-colored graphs for DNA physical mapping / rank
 
Normal rank
Property / cites work
 
Property / cites work: Quadratic Kernelization for Convex Recoloring of Trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Two strikes against perfect phylogeny / rank
 
Normal rank
Property / cites work
 
Property / cites work: Connected Coloring Completion for General Graphs: Algorithms and Complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Dynamic Programming Approach to the Dominating Set Problem on <i>k</i>-Trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4947393 / 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: Q4503944 / 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: Parametrized complexity theory. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the complexity of DNA physical mapping / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding and Counting Vertex-Colored Subtrees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Deconstructing Intractability: A Case Study for Interval Constrained Coloring / rank
 
Normal rank
Property / cites work
 
Property / cites work: Triangulating Vertex-Colored Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms and Data Structures / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph minors. II. Algorithmic aspects of tree-width / rank
 
Normal rank
Property / DBLP publication ID
 
Property / DBLP publication ID: journals/jcss/FellowsFHV11 / rank
 
Normal rank

Latest revision as of 06:35, 13 November 2024

scientific article
Language Label Description Also known as
English
Upper and lower bounds for finding connected motifs in vertex-colored graphs
scientific article

    Statements

    Upper and lower bounds for finding connected motifs in vertex-colored graphs (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    28 April 2011
    0 references
    graph motif
    0 references
    graph pattern matching
    0 references
    parameterized complexity
    0 references
    W hardness
    0 references
    treewidth
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers