Linear-time algorithm for vertex 2-coloring without monochromatic triangles on planar graphs.

Michal Karpinski Krzysztof Piecuch

Published in: CoRR (2021)

Keyphrases

dynamic programming
optimal solution
computational complexity
linear programming
k means
worst case
objective function
probabilistic model
knapsack problem
np hard
expectation maximization
tree structure
graph structure
piecewise linear
undirected graph
planar graphs