Recommendations
Cites work
- Color-coding
- Fast polynomial-space algorithms using inclusion-exclusion. Improving on Steiner tree and related problems
- Fast witness extraction using a decision oracle
- Finding and counting vertex-colored subtrees
- Further hardness results on rainbow and strong rainbow connectivity
- Graph theory
- Hardness and algorithms for rainbow connection
- On the rainbow connectivity of graphs: complexity and FPT algorithms
- Parameterized algorithms
- Probably optimal graph motifs
- The complexity of determining the rainbow vertex-connection of a graph
- The rainbow connection of a graph is (at most) reciprocal to its minimum degree
Cited in
(11)- Simultaneous time-space upper bounds for red-blue path problem in planar DAGs
- scientific article; zbMATH DE number 7559154 (Why is no real title available?)
- Fine-Grained Reductions and Quantum Speedups for Dynamic Programming.
- A branch-and-price-and-cut algorithm for operating room scheduling under human resource constraints
- Finding colorful paths in temporal graphs
- Fine-Grained Complexity of Rainbow Coloring and its Variants.
- The rainbow Steiner tree problem
- Parameterized algorithms for list \(K\)-cycle
- Fixed-parameter tractability of maximum colored path and beyond
- On the fine-grained complexity of rainbow coloring
- Fine-grained complexity of rainbow coloring and its variants
This page was built for publication: On finding rainbow and colorful paths
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q266284)
