Title: An efficient algorithm for maximum cliques problem on IoT devices

Authors: Zine El Abidine Bouneb

Addresses: Department of Mathematics and Computer Science, University of Oum El Bouaghi, B.P. 358 route de Constantine, Oum El Bouaghi 04000, Algeria

Abstract: This work describes how the maximum clique problem (MCP) algorithm can be performed on microcontrollers in a dynamic environment. In practice, many problems can be formalised using MCP and graphs where our problem is considered in the context of a dynamic environment. MCP is, however, a tricky problem NP-Complete for which suitable solutions must be designed for microcontrollers. Microcontrollers are built for specific purposes and optimised to meet different constraints, such as timing, nested recursion depth limitation, or no recursion at all due to recursion stack limitation, power, and RAM limitation. On another side, graph representation and all the algorithms mentioned in the literature to solve the MCP problem, which is recursive, consumes memory and is designed specifically for computers rather than a microcontroller.

Keywords: maximal clique enumeration; MCE; maximum clique problem; MCP; microcontrollers; internet of things; IoT; agent coalition; symbolic computation; n queens completion problem; MicroPython.

DOI: 10.1504/IJCSE.2023.129148

International Journal of Computational Science and Engineering, 2023 Vol.26 No.1, pp.1 - 11

Received: 26 Jun 2021
Accepted: 24 Oct 2021
Published online: 23 Feb 2023 *