429 search results - page 2 / 86 » Solving the Maximum Clique Problem Using PUBB |
AAIM
2006
Springer
13 years 11 months ago
2006
Springer
IPPS
2005
IEEE
13 years 11 months ago
2005
IEEE
We construct parallel algorithms with implementations to solve the clique problem in practice and research their computing time compared with sequential algorithms. The parallel a...
CVPR
1998
IEEE
14 years 7 months ago
1998
IEEE
Markov Random Fields (MRF's) can be used for a wide variety of vision problems. In this paper we focus on MRF's with two-valued clique potentials, which form a generaliz...
JAIR
2006
13 years 5 months ago
2006
In this paper, we introduce DLS-MC, a new stochastic local search algorithm for the maximum clique problem. DLS-MC alternates between phases of iterative improvement, during which...
IOR
2011
13 years 7 days ago
2011
This paper introduces and studies the maximum k-plex problem, which arises in social network analysis and has wider applicability in several important areas employing graph-based ...