Abstract: 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 ...
Abstract: In this article, two types of problems: 1) unconstrained and 2) constrained optimization are solved by developing a class of distributed predefined-time algorithms under dynamic event ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results
Feedback