Pages that link to "Item:Q266284"
From MaRDI portal
The following pages link to On finding rainbow and colorful paths (Q266284):
Displaying 8 items.
- Parameterized algorithms for list \(K\)-cycle (Q666679) (← links)
- Fine-grained complexity of rainbow coloring and its variants (Q2051859) (← links)
- Finding colorful paths in temporal graphs (Q2086641) (← links)
- The rainbow Steiner tree problem (Q2669791) (← links)
- (Q5090495) (← links)
- Fine-Grained Reductions and Quantum Speedups for Dynamic Programming. (Q5091156) (← links)
- Fine-Grained Complexity of Rainbow Coloring and its Variants. (Q5111276) (← links)
- A branch-and-price-and-cut algorithm for operating room scheduling under human resource constraints (Q6164341) (← links)
