The Floyd-Warshall algorithm is a simple and widely used algorithm to compute shortest paths between all pairs of vertices in an edge weighted directed graph. It can also be used ...
—Complex networks can often be divided in dense sub-networks called communities. Using a partition edit distance, we study how three community detection algorithms transform thei...
In this paper we present self-adaptive differential evolution algorithm jDElsgo on large scale global optimization. The experimental results obtained by our algorithm on benchmark ...
Janez Brest, Ales Zamuda, Iztok Fister, Mirjam Sep...
In this paper, the issue of network topology control in wireless networks using a fully distributed algorithm is considered. Whereas the proposed distributed algorithm is designed...
Pau Closas, Alba Pages-Zamora, Juan A. Ferná...
One of the most important open problems of parallel LTL model-checking is to design an on-the-fly scalable parallel algorithm with linear time complexity. Such an algorithm would g...