Pages that link to "Item:Q1124602"
From MaRDI portal
The following pages link to An on-line graph coloring algorithm with sublinear performance ratio (Q1124602):
Displayed 18 items.
- Online promise problems with online width metrics (Q859981) (← links)
- Online unit clustering: Variations on a theme (Q954982) (← links)
- Effective on-line coloring of \(P_ 5\)-free graphs (Q1180418) (← links)
- The greedy algorithm is optimal for on-line edge coloring (Q1209350) (← links)
- On-line coloring \(k\)-colorable graphs (Q1264277) (← links)
- Lower bounds for on-line graph coloring (Q1331951) (← links)
- On-line load balancing (Q1331958) (← links)
- Nonclairvoyant scheduling (Q1331961) (← links)
- On-line scheduling of jobs with fixed start and end times (Q1331962) (← links)
- On-line coloring of perfect graphs (Q1375694) (← links)
- On-line 3-chromatic graphs. II: Critical graphs (Q1377872) (← links)
- On-line vertex-covering (Q1770381) (← links)
- The on-line first-fit algorithm for radio frequency assignment problems. (Q1853136) (← links)
- Online independent sets. (Q1853575) (← links)
- On the on-line chromatic number of the family of on-line 3-chromatic graphs (Q1916112) (← links)
- On-line maximum-order induced hereditary subgraph problems (Q4670672) (← links)
- On the Max Coloring Problem (Q5443379) (← links)
- On the Online Unit Clustering Problem (Q5443383) (← links)