On the Fine-Grained Complexity of Rainbow Coloring (Q3174728): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: New Hardness Results in Rainbow Connectivity / rank
 
Normal rank
Property / cites work
 
Property / cites work: On rainbow connection / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hardness and algorithms for rainbow connection / rank
 
Normal rank
Property / cites work
 
Property / cites work: Rainbow Colouring of Split and Threshold Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Inapproximability of Rainbow Colouring / rank
 
Normal rank
Property / cites work
 
Property / cites work: Rainbow colouring of split graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Rainbow connection in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3525736 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tight Bounds for Graph Homomorphism and Subgraph Isomorphism / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parameterized Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3586724 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the complexity of rainbow coloring problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Dynamic Programming Approach to Sequencing Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the complexity of \(k\)-SAT / rank
 
Normal rank
Property / cites work
 
Property / cites work: Which problems have strongly exponential complexity? / rank
 
Normal rank
Property / cites work
 
Property / cites work: On set intersection representations of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Fine-Grained Complexity of Rainbow Coloring / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on the complexity of the chromatic number problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Rainbow connections of graphs: a survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4231923 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tight lower bound for the channel assignment problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A simplified NP-complete satisfiability problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the rainbow connectivity of graphs: complexity and FPT algorithms / rank
 
Normal rank

Revision as of 03:26, 16 July 2024

scientific article
Language Label Description Also known as
English
On the Fine-Grained Complexity of Rainbow Coloring
scientific article

    Statements

    On the Fine-Grained Complexity of Rainbow Coloring (English)
    0 references
    0 references
    0 references
    0 references
    18 July 2018
    0 references
    graph coloring
    0 references
    computational complexity
    0 references
    lower bounds
    0 references
    FPT algorithms
    0 references

    Identifiers

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