Get the latest tech news
The Fastest Way yet to Color Graphs
Researchers have devised a scheme for painting the edges of a graph that’s almost as speedy as possible.
“We were aware that the techniques we’d introduced so far were useful to get some kind of improvement, but none of them actually had enough power to get the algorithm down to near-linear time,” said Martín Costa, a doctoral student at the University of Warwick and the coauthor of several papers on edge coloring, including last year’s advances. “It’s a breakthrough — an amazing result,” said Robert Tarjan, a computer scientist at Princeton University and a winner of the Turing Award, considered the field’s highest honor. David Wajc, a computer scientist at the Technion in Haifa, Israel, finds the result “inspirational” — the culmination of decades of research dating back to the 1960s.
Or read this on Hacker News
