Pages that link to "Item:Q3637114"
From MaRDI portal
The following pages link to Deconstructing Intractability: A Case Study for Interval Constrained Coloring (Q3637114):
Displayed 7 items.
- The interval constrained 3-coloring problem (Q500992) (← links)
- Approximation algorithms for the interval constrained coloring problem (Q639285) (← links)
- Parameterizing by the number of numbers (Q692894) (← links)
- Upper and lower bounds for finding connected motifs in vertex-colored graphs (Q716314) (← links)
- Fixed-parameter algorithms for Kemeny rankings (Q1035688) (← links)
- On the approximability of the maximum interval constrained coloring problem (Q1662109) (← links)
- Complexity of Splits Reconstruction for Low-Degree Trees (Q3104774) (← links)