2531 search results - page 94 / 507 » Group testing in graphs |
90
Voted
GECCO
2004
Springer
15 years 6 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 ...
100
click to vote
AAAI
1994
15 years 2 months ago
1994
So far, tractable planning problems reported in the literature have been defined by syntactical restrictions. To better exploit the inherent structure in problems, however, it is ...
91
Voted
COMBINATORICS
2006
15 years 22 days ago
2006
Using two backtrack algorithms based on different techniques, designed and implemented independently, we were able to determine up to isomorphism all strongly regular graphs with ...
97
Voted
COMBINATORICS
2000
15 years 16 days ago
2000
We construct examples of nonnegative harmonic functions on certain graded graphs: the Young lattice and its generalizations. Such functions first emerged in harmonic analysis on th...
152
Voted
ICPP
1995
IEEE
15 years 4 months ago
1995
IEEE
– In this paper we present experiments with a class of graph partitioning algorithms that reduce the size of the graph by collapsing vertices and edges, partition the smaller gra...