Pages that link to "Item:Q1643155"
From MaRDI portal
The following pages link to Parameterized complexity and approximation issues for the colorful components problems (Q1643155):
Displaying 11 items.
- On the complexity of some colorful problems parameterized by treewidth (Q627124) (← links)
- Parameterized complexity and approximation issues for the colorful components problems (Q1643155) (← links)
- Tight lower and upper bounds for the complexity of canonical colour refinement (Q2398207) (← links)
- Parameterized algorithms for load coloring problem (Q2448120) (← links)
- Colourful components in \(k\)-caterpillars and planar graphs (Q2664941) (← links)
- Tight Lower and Upper Bounds for the Complexity of Canonical Colour Refinement (Q2849306) (← links)
- Approximation Algorithms for Bounded Color Matchings via Convex Decompositions (Q2922649) (← links)
- On the Kernelization Complexity of Colorful Motifs (Q3058688) (← links)
- (Q3188264) (redirect page) (← links)
- Parameterized Complexity of Coloring Problems: Treewidth versus Vertex Cover (Q3630207) (← links)
- Finding a Small Number of Colourful Components (Q5088911) (← links)
