Decremental Clique Problem

The clique problem consists in determining whether an undirected graph G of order n contains a clique of order . In this paper we are concerned with the decremental version of clique problem, where the property of containing an -clique is dynamically checked during deletions of nodes. We provide an improved dynamic algorithm for this problem for every fixed value of ≥ 3. Our algorithm naturally applies to filtering for the constraint satisfaction problem. In particular, we show how to speed up the filtering based on an important local consistency property: the inverse consistency.

• Type: Conference
• Year: 2004
• Where: WG
• Authors: Fabrizio Grandoni, Giuseppe F. Italiano
• Keywords: Clique Problem, Computer Science, Constraint Satisfaction Problem, Improved Dynamic Algorithm, WG 2004