Methods of providing approximate solutions to the maximum clique of a graph using expansion of cliques of subgraphs within a graph and related circuits and processor-executable instructions

• Main Authors: Mallick, Antik, Shukla, Nikhil Shrikant, Bashar, Mohammad Khairul
• Format: Patent
• Language: English
• Published: 06.09.2022
• Subjects: CALCULATING; COMPUTING; COUNTING; ELECTRIC DIGITAL DATA PROCESSING; PHYSICS

A method of approximating a maximum clique of a graph can be provided by operating a plurality of non-linear oscillator/coupling capacitor circuits connected to one another according to a respective plurality of degree-ordered subgraphs of the graph to provide respective candidate cliques for a maximum clique of the graph. Nodes in the graph that are connected to all of the nodes in each of the respective candidate cliques can be identified to provide respective expansion node subgraphs for the respective candidate cliques. The plurality of non-linear oscillator/coupling capacitor circuits connected to one another according to the respective expansion node subgraphs can be operated to provide respective expansion cliques for the respective candidate cliques and the respective expansion cliques can be added to the respective candidate cliques to identify a designated maximum clique for the graph.