Pages that link to "Item:Q2857441"
From MaRDI portal
The following pages link to Algorithmic approaches for the minimum rainbow subgraph problem (Q2857441):
Displaying 10 items.
- Revisiting a randomized algorithm for the minimum rainbow subgraph problem (Q501008) (← links)
- Approximation algorithms for the minimum rainbow subgraph problem (Q709311) (← links)
- On the approximability of the minimum rainbow subgraph problem and other related problems (Q1679237) (← links)
- The parameterized complexity of the rainbow subgraph problem (Q1736640) (← links)
- The rainbow spanning forest problem (Q1797922) (← links)
- Improved approximation bounds for the minimum rainbow subgraph problem (Q1944047) (← links)
- Better lower and upper bounds for the minimum rainbow subgraph problem (Q2250438) (← links)
- On the minimum rainbow subgraph number of a graph (Q2925427) (← links)
- The Parameterized Complexity of the Rainbow Subgraph Problem (Q2945198) (← links)
- Algorithms for the Rainbow Vertex Coloring Problem on Graph Classes (Q5089235) (← links)