Pages that link to "Item:Q2904478"
From MaRDI portal
The following pages link to Partitioning into Colorful Components by Minimum Edge Deletions (Q2904478):
Displaying 6 items.
- Algorithmic and hardness results for the colorful components problems (Q747623) (← links)
- Parameterized complexity and approximation issues for the colorful components problems (Q1643155) (← links)
- Colourful components in \(k\)-caterpillars and planar graphs (Q2664941) (← links)
- Approximation and Hardness Results for the Maximum Edges in Transitive Closure Problem (Q2946037) (← links)
- Finding a Small Number of Colourful Components (Q5088911) (← links)
- Removing colors 2k, 2k − 1, and k (Q5218909) (← links)