5 search results - page 1 / 1 » Finding Large Clique Minors is Hard |
CORR
2008
Springer
13 years 4 months ago
2008
Springer
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...
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...
SODA
2012
ACM
11 years 7 months ago
2012
ACM
Bidimensionality theory was introduced by Demaine et al. [JACM 2005 ] as a framework to obtain algorithmic results for hard problems on minor closed graph classes. The theory has ...
NIPS
2007
13 years 6 months ago
2007
We present a novel message passing algorithm for approximating the MAP problem in graphical models. The algorithm is similar in structure to max-product but unlike max-product it ...