Finding maximum cliques with distributed ants

Thang N. Bui; Joseph R. Rizzo

doi:10.1007/978-3-540-24854-5_3

Finding maximum cliques with distributed ants

Thang N. Bui, Joseph R. Rizzo

School of Science, Engineering & Technology (Harrisburg)

Research output: Chapter in Book/Report/Conference proceeding › Chapter

15 Citations (SciVal)

Abstract

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 graph. Working together the ants induce a candidate set of vertices from which a clique can be constructed. The algorithm was designed so that it can be easily implemented in a distributed system. One such implementation is also described in the paper. For 22 of the 30 graphs tested ASMC found the optimal solution. For the remaining graphs ASMC produced solutions that are within 16% of the optimal, with most being within 8% of the optimal. The performance of ASMC is comparable to existing algorithms.

Original language	English (US)
Title of host publication	Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Editors	Kalyanmoy Deb, Riccardo Poli, Owen Holland, Kalyanmoy Banzhaf, Hans-Georg Beyer, Edmund Burke, Paul Darwen, Dipankar Dasgupta, Dario Floreano, James Foster, Mark Harman, Pier Luca Lanzi, Lee Spector, Andrea G. B. Tettamanzi, Dirk Thierens, Andrew M. Tyrrell
Publisher	Springer Verlag
Pages	24-35
Number of pages	12
ISBN (Print)	3540223444, 9783540223443
DOIs	https://doi.org/10.1007/978-3-540-24854-5_3
State	Published - 2004

Publication series

Name	Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume	3102
ISSN (Print)	0302-9743
ISSN (Electronic)	1611-3349

All Science Journal Classification (ASJC) codes

Theoretical Computer Science
Computer Science(all)

Access to Document

10.1007/978-3-540-24854-5_3

Cite this

Bui, T. N., & Rizzo, J. R. (2004). Finding maximum cliques with distributed ants. In K. Deb, R. Poli, O. Holland, K. Banzhaf, H-G. Beyer, E. Burke, P. Darwen, D. Dasgupta, D. Floreano, J. Foster, M. Harman, P. L. Lanzi, L. Spector, A. G. B. Tettamanzi, D. Thierens, & A. M. Tyrrell (Eds.), Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (pp. 24-35). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 3102). Springer Verlag. https://doi.org/10.1007/978-3-540-24854-5_3

Bui, Thang N. ; Rizzo, Joseph R. / Finding maximum cliques with distributed ants. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). editor / Kalyanmoy Deb ; Riccardo Poli ; Owen Holland ; Kalyanmoy Banzhaf ; Hans-Georg Beyer ; Edmund Burke ; Paul Darwen ; Dipankar Dasgupta ; Dario Floreano ; James Foster ; Mark Harman ; Pier Luca Lanzi ; Lee Spector ; Andrea G. B. Tettamanzi ; Dirk Thierens ; Andrew M. Tyrrell. Springer Verlag, 2004. pp. 24-35 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).

@inbook{e3c07b2b907b4688afbb6341ee5287c5,

title = "Finding maximum cliques with distributed ants",

abstract = "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 graph. Working together the ants induce a candidate set of vertices from which a clique can be constructed. The algorithm was designed so that it can be easily implemented in a distributed system. One such implementation is also described in the paper. For 22 of the 30 graphs tested ASMC found the optimal solution. For the remaining graphs ASMC produced solutions that are within 16% of the optimal, with most being within 8% of the optimal. The performance of ASMC is comparable to existing algorithms.",

author = "Bui, {Thang N.} and Rizzo, {Joseph R.}",

year = "2004",

doi = "10.1007/978-3-540-24854-5_3",

language = "English (US)",

isbn = "3540223444",

series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

publisher = "Springer Verlag",

pages = "24--35",

editor = "Kalyanmoy Deb and Riccardo Poli and Owen Holland and Kalyanmoy Banzhaf and Hans-Georg Beyer and Edmund Burke and Paul Darwen and Dipankar Dasgupta and Dario Floreano and James Foster and Mark Harman and Lanzi, {Pier Luca} and Lee Spector and Tettamanzi, {Andrea G. B.} and Dirk Thierens and Tyrrell, {Andrew M.}",

booktitle = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

address = "Germany",

}

Bui, TN & Rizzo, JR 2004, Finding maximum cliques with distributed ants. in K Deb, R Poli, O Holland, K Banzhaf, H-G Beyer, E Burke, P Darwen, D Dasgupta, D Floreano, J Foster, M Harman, PL Lanzi, L Spector, AGB Tettamanzi, D Thierens & AM Tyrrell (eds), Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 3102, Springer Verlag, pp. 24-35. https://doi.org/10.1007/978-3-540-24854-5_3

Finding maximum cliques with distributed ants. / Bui, Thang N.; Rizzo, Joseph R.
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). ed. / Kalyanmoy Deb; Riccardo Poli; Owen Holland; Kalyanmoy Banzhaf; Hans-Georg Beyer; Edmund Burke; Paul Darwen; Dipankar Dasgupta; Dario Floreano; James Foster; Mark Harman; Pier Luca Lanzi; Lee Spector; Andrea G. B. Tettamanzi; Dirk Thierens; Andrew M. Tyrrell. Springer Verlag, 2004. p. 24-35 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 3102).

Research output: Chapter in Book/Report/Conference proceeding › Chapter

TY - CHAP

T1 - Finding maximum cliques with distributed ants

AU - Bui, Thang N.

AU - Rizzo, Joseph R.

PY - 2004

Y1 - 2004

N2 - 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 graph. Working together the ants induce a candidate set of vertices from which a clique can be constructed. The algorithm was designed so that it can be easily implemented in a distributed system. One such implementation is also described in the paper. For 22 of the 30 graphs tested ASMC found the optimal solution. For the remaining graphs ASMC produced solutions that are within 16% of the optimal, with most being within 8% of the optimal. The performance of ASMC is comparable to existing algorithms.

AB - 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 graph. Working together the ants induce a candidate set of vertices from which a clique can be constructed. The algorithm was designed so that it can be easily implemented in a distributed system. One such implementation is also described in the paper. For 22 of the 30 graphs tested ASMC found the optimal solution. For the remaining graphs ASMC produced solutions that are within 16% of the optimal, with most being within 8% of the optimal. The performance of ASMC is comparable to existing algorithms.

UR - http://www.scopus.com/inward/record.url?scp=33750226665&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=33750226665&partnerID=8YFLogxK

U2 - 10.1007/978-3-540-24854-5_3

DO - 10.1007/978-3-540-24854-5_3

M3 - Chapter

AN - SCOPUS:33750226665

SN - 3540223444

SN - 9783540223443

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 24

EP - 35

BT - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

A2 - Deb, Kalyanmoy

A2 - Poli, Riccardo

A2 - Holland, Owen

A2 - Banzhaf, Kalyanmoy

A2 - Beyer, Hans-Georg

A2 - Burke, Edmund

A2 - Darwen, Paul

A2 - Dasgupta, Dipankar

A2 - Floreano, Dario

A2 - Foster, James

A2 - Harman, Mark

A2 - Lanzi, Pier Luca

A2 - Spector, Lee

A2 - Tettamanzi, Andrea G. B.

A2 - Thierens, Dirk

A2 - Tyrrell, Andrew M.

PB - Springer Verlag

ER -

Bui TN, Rizzo JR. Finding maximum cliques with distributed ants. In Deb K, Poli R, Holland O, Banzhaf K, Beyer H-G, Burke E, Darwen P, Dasgupta D, Floreano D, Foster J, Harman M, Lanzi PL, Spector L, Tettamanzi AGB, Thierens D, Tyrrell AM, editors, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Springer Verlag. 2004. p. 24-35. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). doi: 10.1007/978-3-540-24854-5_3

Finding maximum cliques with distributed ants

Abstract

Publication series

All Science Journal Classification (ASJC) codes

Access to Document

Other files and links

Fingerprint

Cite this