Certifying coloring algorithms for graphs without long induced paths.

Marcin Kaminski Anna Pstrucha

Published in: Discret. Appl. Math. (2019)

Keyphrases

learning algorithm
theoretical analysis
shortest path
polynomial time complexity
data sets
machine learning
computational cost
worst case
graphical models
np complete
machine learning algorithms
graph theory
graph representation
representational power
dynamic graph