4 citations · 5 across the 8 of their papers we have counts for
3 papers · 1 filter
Better coloring of 3-colorable graphs
Ken-ichi Kawarabayashi, Mikkel Thorup, Hirotaka Yoneda
We consider the problem of coloring a 3-colorable graph in polynomial time using as few colors as possible. This is one of the most challenging problems in graph algorithms. In thi…
Combinatorial Correlation Clustering
Vincent Cohen-Addad, David Rasmussen Lolck, Marcin Pilipczuk +3
Correlation Clustering is a classic clustering objective arising in numerous machine learning and data mining applications. Given a graph , the goal is to partition the ve…
Minimum-cost paths for electric cars
Dani Dorfman, Haim Kaplan, Robert E. Tarjan +2
An electric car equipped with a battery of a finite capacity travels on a road network with an infrastructure of charging stations. Each charging station has a possibly different c…