The Lovász Theta Function for Recovering Planted Clique Covers and Graph Colorings.

Jiaxin Hou Yong Sheng Soh Antonios Varvitsiotis

Published in: CoRR (2023)

Keyphrases

maximum clique
graph representation
maximum weight
independent set
directed graph
graph structure
graph theoretic
graph properties
graph theory
graph model
spanning tree
quasi cliques
worst case
graph based algorithm
minimum spanning tree
piecewise linear
graph matching
structured data
random walk