Method for enumerating cliques
First Claim
Patent Images
1. A method for enumerating at least one maximal clique, comprising the steps of:
- obtaining data, wherein the data comprises a graph;
obtaining a user-specified minimum size restriction on at least one maximal clique of interest in the graph;
filtering the data based on the user-specified minimum size restriction and an extent of overlap in one or more neighborhoods of two vertices joined by an edge to reduce graph size, wherein said filtering comprises counting a number of one or more nodes that are common in the one or more neighborhoods, and wherein if the number of such common neighbor nodes exceeds a specified number, retaining the edge, else discarding the edge; and
enumerating at least one maximal clique from the graph provided that at least one maximal clique exists above the user-specified minimum size restriction.
1 Assignment
0 Petitions
Accused Products
Abstract
Techniques for enumerating at least one maximal clique are provided. The techniques include obtaining data, wherein the data comprises a graph, obtaining a user-specified minimum size restriction on at least one maximal clique of interest, filtering the data using the user-specified minimum size restriction to reduce graph size, and enumerating at least one maximal clique from the graph provided that at least one maximal clique exists above the user-specified minimum size restriction.
-
Citations
17 Claims
-
1. A method for enumerating at least one maximal clique, comprising the steps of:
-
obtaining data, wherein the data comprises a graph; obtaining a user-specified minimum size restriction on at least one maximal clique of interest in the graph; filtering the data based on the user-specified minimum size restriction and an extent of overlap in one or more neighborhoods of two vertices joined by an edge to reduce graph size, wherein said filtering comprises counting a number of one or more nodes that are common in the one or more neighborhoods, and wherein if the number of such common neighbor nodes exceeds a specified number, retaining the edge, else discarding the edge; and enumerating at least one maximal clique from the graph provided that at least one maximal clique exists above the user-specified minimum size restriction. - View Dependent Claims (2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12)
-
-
13. A computer program product comprising a tangible computer readable recordable storage medium having computer readable program code for enumerating at least one maximal clique, said computer program product including:
-
computer readable program code for obtaining data, wherein the data comprises a graph; computer readable program code for obtaining a user-specified minimum size restriction on at least one maximal clique of interest in the graph; computer readable program code for filtering the data based on the user-specified minimum size restriction and an extent of overlap in one or more neighborhoods of two vertices joined by an edge to reduce graph size, wherein said filtering comprises counting a number of one or more nodes that are common in the one or more neighborhoods, and wherein if the number of such common neighbor nodes exceeds a specified number, retaining the edge, else discarding the edge; and computer readable program code for enumerating at least one maximal clique from the graph provided that at least one maximal clique exists above the user-specified minimum size restriction. - View Dependent Claims (14, 15)
-
-
16. An apparatus for enumerating at least one maximal clique, comprising:
-
a memory; and at least one processor coupled to said memory and operative to; obtain data, wherein the data comprises a graph; obtain a user-specified minimum size restriction on at least one maximal clique of interest in the graph; filter the data based on the user-specified minimum size restriction and an extent of overlap in one or more neighborhoods of two vertices joined by an edge to reduce graph size, wherein said filtering comprises counting a number of one or more nodes that are common in the one or more neighborhoods, and wherein if the number of such common neighbor nodes exceeds a specified number, retaining the edge, else discarding the edge; and enumerate at least one maximal clique from the graph provided that at least one maximal clique exists above the user-specified minimum size restriction. - View Dependent Claims (17)
-
Specification