16 search results - page 1 / 4 » Large Maximal Cliques Enumeration in Large Sparse Graphs |
COMAD
2009
13 years 6 months ago
2009
Identifying communities in social networks is a problem of great interest. One popular type of community is where every member of the community knows all others, which can be view...
AICCSA
2008
IEEE
13 years 11 months ago
2008
IEEE
This paper presents a systematic approach to mine colocation patterns in Sloan Digital Sky Survey (SDSS) data. SDSS Data Release 5 (DR5) contains 3.6 TB of data. Availability of s...
SIGMOD
2010
ACM
13 years 9 months ago
2010
ACM
Maximal clique enumeration (MCE) is a fundamental problem in graph theory and has important applications in many areas such as social network analysis and bioinformatics. The prob...
SWAT
2004
Springer
13 years 10 months ago
2004
Springer
In this paper, we consider the problems of generating all maximal (bipartite) cliques in a given (bipartite) graph G = (V, E) with n vertices and m edges. We propose two algorithms...
TCAD
2010
12 years 11 months ago
2010
The last decade has witnessed the emergence of the application-specific instruction-set processor (ASIP) as a viable platform for embedded systems. Extensible ASIPs allow the user ...