2 citations · 4 across the 7 of their papers we have counts for
1 paper · 2 filters
Martin Böhm, Pavel Veselý
In the online graph coloring problem, vertices from a graph G, known in advance, arrive in an online fashion and an algorithm must immediately assign a color to each incoming verte…