7 search results - page 1 / 2 » Finding Maximum Cliques with Distributed Ants |
GECCO
2004
Springer
13 years 10 months ago
2004
Springer
In this paper we describe an ant system algorithm (ASMC) for the problem of finding the maximum clique in a given graph. In the algorithm each ant has only local knowledge of the ...
IPPS
1998
IEEE
13 years 9 months ago
1998
IEEE
Given an (undirected) graph G = V; E; a clique of G is a subset of vertices in which every pair is connected by an edge. The problem of finding a clique of maximum size is a class...
HEURISTICS
2006
13 years 4 months ago
2006
This paper investigates the capabilities of the Ant Colony Optimization (ACO) meta-heuristic for solving the maximum clique problem, the goal of which is to find a largest set of ...
GECCO
2009
Springer
13 years 2 months ago
2009
Springer
This paper describes a general scheme to convert sequential ant-based algorithms into parallel shared memory algorithms. The scheme is applied to an ant-based algorithm for the ma...
JGAA
2000
13 years 4 months ago
2000
This paper considers problems of the following type: given an edgeweighted k-colored input graph with maximum color class size c, find a minimum or maximum c-way cut such that eac...