Distributed memory implementation of Bron-Kerbosch algorithm

This paper proposes a parallel implementation of the Bron-Kerbosch algorithm, which finds all maximal cliques in large, complex graphs using CPU and thread-level parallelism and distributed memory with multiple cores. With the growing size and complexity of modern graphs, sequential algorithms can b...

Celý popis

Uloženo v:

Podrobná bibliografie
Vydáno v:	IEEE access Ročník 12; s. 1
Hlavní autoři:	Rote, Tejas Ravindra, Krishnamoorthy, Murugan, Bhatia, Ansh, Yadav, Rishu, Raja, S. P.
Médium:	Journal Article
Jazyk:	angličtina
Vydáno:	Piscataway IEEE 01.01.2024 The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Témata:	Algorithms Bio-informatics Bioinformatics Bron-Kerbosch algorithm Central processing units Complexity Complexity theory Compute nodes Compute threads CPUs Distributed management Distributed memory Graph theory Graphs High performance computing Instruction sets Machine learning algorithms Maximal cliques Memory Network analysis Network security Parallel computing Parallel processing Performance optimization Proteins Scalability Social network analysis Social networking (online) Social networks
ISSN:	2169-3536, 2169-3536
On-line přístup:	Získat plný text
Tagy:	Přidat tag Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!

Buďte první, kdo okomentuje tento záznam!