Pages that link to "Item:Q4339004"
From MaRDI portal
The following pages link to Parallel and On-Line Graph Coloring (Q4339004):
Displaying 12 items.
- A fast greedy sequential heuristic for the vertex colouring problem based on bitwise operations (Q281816) (← links)
- On the online track assignment problem (Q423916) (← links)
- Online coloring of hypergraphs (Q656575) (← links)
- Online chromatic number is PSPACE-complete (Q726097) (← links)
- A better performance guarantee for approximate graph coloring (Q911757) (← links)
- Tight bounds for online coloring of basic graph classes (Q2223701) (← links)
- (Q4249728) (← links)
- Tight Bounds for Online Coloring of Basic Graph Classes (Q5111690) (← links)
- Dynamic graph coloring (Q5915986) (← links)
- (Q6084415) (← links)
- Competitive vertex recoloring. (Online disengagement) (Q6107890) (← links)
- Online coloring of short intervals (Q6201896) (← links)