4 citations · 6 across the 3 of their papers we have counts for
1 paper · 2 filters
Łukasz Kowalik, Arkadiusz Socała
The fastest algorithms for edge coloring run in time 2mnO(1), where m and n are the number of edges and vertices of the input graph, respectively. For dense graphs, this…