Mostra el registre d'ítem simple
FrogCOL and FrogMIS: new decentralized algorithms for finding large independent sets in graphs
dc.contributor.author | Blum, Christian |
dc.contributor.author | Calvo, Borja |
dc.contributor.author | Blesa Aguilera, Maria Josep |
dc.contributor.other | Universitat Politècnica de Catalunya. Departament de Ciències de la Computació |
dc.date.accessioned | 2015-10-19T14:33:02Z |
dc.date.available | 2016-08-01T00:30:41Z |
dc.date.created | 2015-09-01 |
dc.date.issued | 2015-09-01 |
dc.identifier.citation | Blum, C., Calvo, B., Blesa, M. FrogCOL and FrogMIS: new decentralized algorithms for finding large independent sets in graphs. "Swarm intelligence", 01 Setembre 2015, vol. 9, núm. 2-3, p. 205-227. |
dc.identifier.issn | 1935-3812 |
dc.identifier.uri | http://hdl.handle.net/2117/77894 |
dc.description.abstract | Finding large (and generally maximal) independent sets of vertices in a given graph is a fundamental problem in distributed computing. Applications include, for example, facility location and backbone formation in wireless ad hoc networks. In this paper, we study a decentralized (or distributed) algorithm inspired by the calling behavior of male Japanese tree frogs, originally introduced for the graph-coloring problem, for its potential usefulness in the context of finding large independent sets. Moreover, we adapt this algorithm to directly produce maximal independent sets without the necessity of first producing a graph-coloring solution. Both algorithms are compared to a wide range of decentralized algorithms from the literature on a diverse set of benchmark instances for the maximal independent set problem. The results show that both algorithms compare very favorably to their competitors. |
dc.format.extent | 23 p. |
dc.language.iso | eng |
dc.subject | Àrees temàtiques de la UPC::Informàtica::Informàtica teòrica::Algorísmica i teoria de la complexitat |
dc.subject.lcsh | Algorithms |
dc.subject.lcsh | Graph theory |
dc.subject.lcsh | Ad hoc networks (Computer networks) |
dc.subject.other | Swarm intelligence |
dc.subject.other | Self-desynchronization |
dc.subject.other | Maximal independent set |
dc.subject.other | Decentralized algorithms |
dc.title | FrogCOL and FrogMIS: new decentralized algorithms for finding large independent sets in graphs |
dc.type | Article |
dc.subject.lemac | Algorismes |
dc.subject.lemac | Grafs, Teoria de |
dc.contributor.group | Universitat Politècnica de Catalunya. ALBCOM - Algorismia, Bioinformàtica, Complexitat i Mètodes Formals |
dc.identifier.doi | 10.1007/s11721-015-0110-1 |
dc.description.peerreviewed | Peer Reviewed |
dc.relation.publisherversion | http://link.springer.com/article/10.1007/s11721-015-0110-1 |
dc.rights.access | Open Access |
local.identifier.drac | 16870468 |
dc.description.version | Postprint (author’s final draft) |
local.citation.author | Blum, C.; Calvo, B.; Blesa, M. |
local.citation.publicationName | Swarm intelligence |
local.citation.volume | 9 |
local.citation.number | 2-3 |
local.citation.startingPage | 205 |
local.citation.endingPage | 227 |
Fitxers d'aquest items
Aquest ítem apareix a les col·leccions següents
-
Articles de revista [1.049]
-
Articles de revista [274]