2 search results - page 1 / 1 » Finding maximal cliques in massive networks by H*-graph |
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...
COMAD
2009
13 years 5 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...