Paper Image

Accelerating maximal clique search via graph reduction

Published on:

1 November 2023

Primary Category:


Paper Authors:

Wen Deng,

Weiguo Zheng,

Hong Cheng


Key Details

Proposes RMCE, a reduction-based framework to accelerate maximal clique enumeration

Develops global reduction techniques to shrink input graph size

Introduces dynamic reduction to minimize subgraph size in recursive calls

Reduces maximality check cost by pruning unnecessary vertices from forbidden set

AI generated summary

Accelerating maximal clique search via graph reduction

This paper proposes a novel framework called RMCE that accelerates the process of finding all maximal cliques in a graph. It does this by developing techniques to reduce the size of the original graph as well as subgraphs that are examined recursively during the search process. This helps prune the search space and avoid redundant computations. The methods include removing low-degree vertices, non-triangle edges, dynamically reducing subgraph size, and minimizing the 'forbidden set' used for maximality checks.

Answers from this paper


No comments yet, be the first to start the conversation...

Sign up to comment on this paper

Sign Up