Pages that link to "Item:Q3512460"
From MaRDI portal
The following pages link to Approximating the Interval Constrained Coloring Problem (Q3512460):
Displaying 5 items.
- The interval constrained 3-coloring problem (Q500992) (← links)
- Deconstructing intractability-A multivariate complexity analysis of interval constrained coloring (Q533417) (← links)
- Upper and lower bounds for finding connected motifs in vertex-colored graphs (Q716314) (← links)
- On the approximability of the maximum interval constrained coloring problem (Q1662109) (← links)
- Deconstructing Intractability: A Case Study for Interval Constrained Coloring (Q3637114) (← links)