Processing math: 0%
Maximal Clique Search in Weighted Graphs | IEEE Journals & Magazine | IEEE Xplore

Abstract:

Searching for k-cliques in graphs has been an important problem in graph analysis due to its large number of applications. Previously, finding k-cliques in weighted g...Show More

Abstract:

Searching for k-cliques in graphs has been an important problem in graph analysis due to its large number of applications. Previously, finding k-cliques in weighted graphs aimed at finding cliques with the largest sum of weight (with no distinction between the edge or the vertex weights), usually called the sum model. However, the algorithms under the sum model may result in solutions consisting of low-weight vertices or edges (outliers). To address this issue, we propose a new model named maximal (S, C, K)-clique in weighted graphs and study the problem of maximal (S, C, K)-clique search (MCS). We first propose an enumeration-based algorithm MCSE, which checks every k-clique to identify the maximal (S, C, K)-clique. To improve the efficiency, we further propose two improved algorithms MCSP and MCSC. Instead of checking every possible k-clique, MCSP focuses on (S, C) values that cannot be dominated and obtains the maximal (S, C, K)-cliques directly based on these values. MCSC is devised by further optimizing MCSP based on some key observations on maximal cliques and cliques’ nesting property. We also propose two index structures, BCS-Index and ICS-Index, to achieve optimal query. The former stores all maximal (S, C, K)-cliques, while the latter uses the clique's nesting property to reduce the space cost of index construction. Extensive experiments conducted on six real graphs demonstrate the efficiency and effectiveness of our proposed algorithms.
Published in: IEEE Transactions on Knowledge and Data Engineering ( Volume: 35, Issue: 9, 01 September 2023)
Page(s): 9421 - 9432
Date of Publication: 24 January 2023

ISSN Information:

Funding Agency:


References

References is not available for this document.