Certifying coloring algorithms for graphs without long induced paths.

Marcin Kaminski Anna Pstrucha

Published in: CoRR (2017)

Keyphrases

bipartite graph
significant improvement
graph theory
data sets
learning algorithm
data structure
multi objective
optimization problems
machine learning algorithms
computational complexity
pairwise
computational cost
worst case
benchmark datasets
data mining algorithms
times faster