Exact exponential algorithms to find tropical connected sets of minimum size (Q527400): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: An exact algorithm for connected red-blue dominating set / 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: Q2816516 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved approximation algorithm for convex recoloring of trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Constrained multilinear detection and generalized graph motifs / 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: 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: Graph-Theoretic Concepts in Computer Science / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding and counting vertex-colored subtrees / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the complexity of \(k\)-SAT / 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: Triangulating Vertex-Colored Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Convex recolorings of strings and trees: Definitions, hardness results and algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast polynomial-space algorithms using inclusion-exclusion. Improving on Steiner tree and related problems / rank
 
Normal rank

Latest revision as of 19:39, 13 July 2024

scientific article
Language Label Description Also known as
English
Exact exponential algorithms to find tropical connected sets of minimum size
scientific article

    Statements

    Exact exponential algorithms to find tropical connected sets of minimum size (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    11 May 2017
    0 references
    0 references
    algorithms
    0 references
    exact exponential algorithms
    0 references
    colored graphs
    0 references
    0 references
    0 references