6 citations · 6 across the 1 of their papers we have counts for
1 paper
Gabrio Caimi, Holger Flier, Martin Fuchsberger +1
In this paper a greedy algorithm to detect conflict cliques in interval graphs and circular-arc graphs is analyzed. In a graph, a stable set requires that at most one vertex is cho…