Enumerating Maximum Cliques in Massive Graphs

Cliques refer to subgraphs in an undirected graph such that vertices in each subgraph are pairwise adjacent. The maximum clique problem, to find the clique with most vertices in a given graph, has been extensively studied. Besides its theoretical value as an NP-hard problem, the maximum clique probl...

Ausführliche Beschreibung

Gespeichert in:

Bibliographische Detailangaben
Veröffentlicht in:	IEEE transactions on knowledge and data engineering Jg. 34; H. 9; S. 4215 - 4230
Hauptverfasser:	Lu, Can, Yu, Jeffrey Xu, Wei, Hao, Zhang, Yikai
Format:	Journal Article
Sprache:	Englisch
Veröffentlicht:	New York IEEE 01.09.2022 The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Schlagworte:	Algorithms Anomalies Apexes Approximation algorithms Bioinformatics Color community search Complex networks Enumeration Gene expression Graph theory Iterative algorithms Iterative methods Lower bounds Maximum clique Search problems Searching Social networking (online) Social networks Upper bound Upper bounds
ISSN:	1041-4347, 1558-2191
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!

Schreiben Sie den ersten Kommentar!