MAXIMUM CLIQUE IN A GRAPH

Patent №

US 7,987,250

Granted

2011-07-26

Filed 2003

Owner

INTERNATIONAL BUSINESS MACHINES CORPORATION

AI components

2

planning · evo

Assignment

Recorded

Dataset

AIPD

2023_r1 edition

Application

10630037

A method and system for maximizing connectivity within members of a group, or for example a clique, in polynomial time. Vertices representing inter-connectivity of each member are placed on a graph in descending order. Least connected members are systematically removed from the graph until the connectivity count of a least connected vertex is equal to a quantity of vertices remaining in the graph. Following the removal of a vertex from the graph, an update of the inter-connectivity of each member on the graph is performed. Accordingly, when the connectivity count of a least connected vertex is equal to a quantity of vertices remaining in the graph a clique with maximum inter-connectivity has been achieved.

AI classification

Evolutionary computation1.00
Planning1.00
Vision0.38
Knowledge representation0.09
AI hardware0.02
Machine learning0.01
Natural language0.00
Speech0.00

Ownership

INTERNATIONAL BUSINESS MACHINES CORPORATION

assignment · 162680317

Assignors

PAI, RAMACHANDRA N.

On an employer assignment, the assignors are typically the inventors.

From the same owner

© 2026 NYSGPT2525 LLC