Tight Bounds for Potential Maximal Cliques Parameterized by Vertex Cover.

Tuukka Korhonen

Published in: CoRR (2020)

Keyphrases

tight bounds
vertex cover
maximal cliques
upper bound
maximum clique
approximation algorithms
planar graphs
graph theory
maximal clique enumeration
partial order
graph theoretic
precedence constraints
optimality criterion
worst case
bipartite graph
complex networks
point correspondences
generative model