Competitive vertex recoloring. (Online disengagement)
From MaRDI portal
Publication:6107890
DOI10.1007/s00453-022-01076-xMaRDI QIDQ6107890
Chay Machluf, Boaz Patt-Shamir, Yossi Azar, Noam Touitou
Publication date: 28 June 2023
Published in: Algorithmica (Search for Journal in Brave)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- An on-line graph coloring algorithm with sublinear performance ratio
- Lower bounds for on-line graph coloring
- Online balanced repartitioning
- Trade-offs in dynamic coloring for bipartite and general graphs
- A linear-time approximation algorithm for the weighted vertex cover problem
- An optimal on-line algorithm for metrical task system
- Parallel and On-Line Graph Coloring
- Improved Dynamic Graph Coloring
- Dynamic Balanced Graph Partitioning
- Dynamic graph coloring
This page was built for publication: Competitive vertex recoloring. (Online disengagement)