Pages that link to "Item:Q2708486"
From MaRDI portal
The following pages link to A linear time approximation algorithm for interval coloring on proper interval graphs (Q2708486):
Displaying 10 items.
- On a reduction of the interval coloring problem to a series of bandwidth coloring problems (Q633552) (← links)
- An optimal greedy heuristic to color interval graphs (Q922724) (← links)
- About equivalent interval colorings of weighted graphs (Q967426) (← links)
- On the sum coloring problem on interval graphs (Q1277392) (← links)
- An approximation result for the interval coloring problem on claw-free chordal graphs (Q1613366) (← links)
- On the \(k\)-coloring of intervals (Q1893157) (← links)
- On the interval chromatic number of proper interval graphs (Q2352054) (← links)
- Fragmented coloring of proper interval and split graphs (Q2355746) (← links)
- Approximations for Aligned Coloring and Spillage Minimization in Interval and Chordal Graphs (Q3638867) (← links)
- LATIN 2004: Theoretical Informatics (Q5901633) (← links)