An On-line Competitive Algorithm for Coloring P_8 -free Bipartite Graphs.

Piotr Micek Veit Wiechert

Published in: ISAAC (2014)

Keyphrases

bipartite graph
k means
dynamic programming
information retrieval
learning algorithm
optimal solution
np hard
maximum matching
objective function
co occurrence
matching algorithm
spanning tree
minimum spanning tree