Rivero Espinosa, JessicaCuadra Fernández, María DoloresCalle Gómez, Francisco JavierIsasi, Pedro2015-04-092015-04-092011-10Computational Aspects of Social Networks (CASoN 2011). pp. 60-65978-1-4577-1132-9https://hdl.handle.net/10016/20394Proceedings of: Third International Conference on Computational Aspects of Social Networks (CASoN).Took place 2011, October,19-21 , in Salamanca (Sapin).The event Web site is http://www.mirlabs.net/cason11/Nowadays the Social Networks are experiencing a growing importance. The reason of this is that they enable the information exchange among people, meeting people in the same field of work or establishing collaborations with other research groups. In order to manage social networks and to find people inside them, they are usually represented as graphs with persons as nodes and relationships between them as edges. Once this is done, establishing contact with anyone involves searching the chain of people to reach him/her, that is, the search of the path inside the graph which joins two nodes. In this paper, a new algorithm based on nature is proposed to realize this search: SoS-ACO (Sense of Smell - Ant Colony Optimization). This algorithm improves the classical ACO algorithm when it is applied in huge graphs.6application/pdfeng© 2011, IEEELarge graphsSocial NetworksACO, DijkstraPath searchconference paperInformática10.1109/CASON.2011.6085919open access6065Computational Aspects of Social Networks (CASoN 2011)CC/0000016935