| doi:10.2201/NiiPi.2012.9.5 |
| Implementation issues of clique enumeration algorithm |
| Takeaki UNO |
| 1National Institute of Informatics |
(Received: October 10,2011)
(Revised: December 6,2011)
(Accepted: December 6,2011) |
Abstract:
A clique is a subgraph in which any two vertices are connected. Clique represents a densely connected structure in the graph, thus used to capture the local related elements such as clustering, frequent patterns, community mining, and so on. In these applications, enumeration of cliques rather than optimization is frequently used. Recent applications have large scale very sparse graphs, thus efficient implementations for clique enumeration is necessary. In this paper, we describe the algorithm techniques (not coding techniques) for obtaining efficient clique enumeration implementations.
|
Keywords:
maximal clique, enumeration, community mining, cluster mining, polynomial time, reverse search
|
|
|
| PDF(122KB) | References |
National Institute of Informatics is a member of CrossRef.
|
