A linear-time algorithm for clique-coloring problem in circular-arc graphs.

Zuosong Liang Erfang Shan Yuzhong Zhang

Published in: J. Comb. Optim. (2017)

Keyphrases

circular arcs
maximum clique
straight line
independent set
graph properties
line segments
quasi cliques
undirected graph
graph theory
straight line segments
directed graph
graph structure
graph databases
graph mining
noise free
maximum weight
bipartite graph
markov random field