Hybrid Bridge-Based Memetic Algorithms for Finding Bottlenecks in Complex Networks

Brandes, 2003, Experiments on graph clustering algorithms, 568 Leskovec, 2010, Empirical comparison of algorithms for network community detection, 631 Blondel, 2008, Fast unfolding of communities in large networks, J. Stat. Mech. Theory Exp., 2008, 10.1088/1742-5468/2008/10/P10008 Girvan, 2002, Community structure in social and biological networks, Proc. Natl. Acad. Sci. USA, 99, 7821, 10.1073/pnas.122653799 Hawick, 2011, Applying enumerative, spectral and hybrid graph analyses to biological network data, 89 Hawick, 2012, Betweenness centrality metrics for assessing electrical power network robustness against fragmentation and node failure, 186 Chen, 2010, Attack structural vulnerability of power grids: a hybrid approach based on complex networks, Physica A, 389, 595, 10.1016/j.physa.2009.09.039 Hawick, 2012, Water distribution network robustness and fragmentation using graph metrics, 304 Hawick, 2016 Schaeffer, 2007, Graph clustering, Comput. Sci. Rev., 1, 27, 10.1016/j.cosrev.2007.05.001 Pizzuti, 2014, Algorithms and tools for protein–protein interaction networks clustering, with a special focus on population-based stochastic methods, Bioinformatics, 30, 1343, 10.1093/bioinformatics/btu034 Leskovec, 2008, Statistical properties of community structure in large social and information networks, 695 Leskovec, 2009, Community structure in large networks: natural cluster sizes and the absence of large well-defined clusters, Internet Math., 6, 29, 10.1080/15427951.2009.10129177 Pizzuti, 2018, Evolutionary computation for community detection in networks: a review, IEEE Trans. Evol. Comput., 10.1109/TEVC.2017.2737600 Backstrom, 2006, Group formation in large social networks: membership, growth, and evolution, 44 Papadopoulos, 2012, Community detection in social media, Data Min. Knowl. Discov., 24, 515, 10.1007/s10618-011-0224-z Metwally, 2007, Detectives: detecting coalition hit inflation attacks in advertising networks streams, 241 Bocewicz, 2017, Reduction of congestion in transport networks with a fractal structure, 189 Khandekar, 2009, 308 Arias-Castro, 2012, The normalized graph cut and Cheeger constant: from discrete to continuous, Adv. Appl. Probab., 44, 907, 10.1239/aap/1354716583 Šíma, 2006, On the NP-completeness of some graph cluster measures, 530 Chawla, 2006, On the hardness of approximating multicut and sparsest-cut, Comput. Complex., 15, 94, 10.1007/s00037-006-0210-9 Chalupa Tarjan, 1974, A note on finding the bridges of a graph, Inf. Process. Lett., 2, 160, 10.1016/0020-0190(74)90003-9 Van Laarhoven, 2016, Local network community detection with continuous optimization of conductance and weighted kernel k-means, J. Mach. Learn. Res., 17, 1 Fortunato, 2010, Community detection in graphs, Phys. Rep., 486, 75, 10.1016/j.physrep.2009.11.002 Chalupa, 2013, Metaheuristically optimized multicriteria clustering for medium-scale networks, vol. 188, 337 Chen, 2013, Second order partial derivatives for NK-landscapes, 503 Tintos, 2015, Partition crossover for pseudo-Boolean optimization, 137 Chicano, 2014, Efficient identification of improving moves in a ball for pseudo-boolean problems, 437 Whitley, 2012, Constant time steepest descent local search with lookahead for NK-landscapes and MAX-kSAT, 1357 Pizzuti, 2012, A multiobjective genetic algorithm to find communities in complex networks, IEEE Trans. Evol. Comput., 16, 418, 10.1109/TEVC.2011.2161090 Benlic, 2011, A multilevel memetic approach for improving graph k-partitions, IEEE Trans. Evol. Comput., 15, 624, 10.1109/TEVC.2011.2136346 Syswerda, 1991, A study of reproduction in generational and steady state genetic algorithms, Found. Genet. Algorithms, 2, 94 Takac, 2012, Data analysis in public social networks, 1 J. Leskovec, A. Krevl, SNAP Datasets: Stanford large network dataset collection. Salwinski, 2004, The database of interacting proteins: 2004 update, Nucleic Acids Res., 32, D449, 10.1093/nar/gkh086 Xenarios, 2001, DIP: the Database of Interacting Proteins: 2001 update, Nucleic Acids Res., 29, 239, 10.1093/nar/29.1.239 Xenarios, 2000, DIP: the Database of Interacting Proteins, Nucleic Acids Res., 28, 289, 10.1093/nar/28.1.289 Xenarios, 2002, DIP, the Database of Interacting Proteins: a research tool for studying cellular networks of protein interactions, Nucleic Acids Res., 30, 303, 10.1093/nar/30.1.303 Newman, 2006, Finding community structure in networks using the eigenvectors of matrices, Phys. Rev. E, 74 Knuth, 1993 Watts, 1998, Collective dynamics of “small-world” networks, Nature, 393, 440, 10.1038/30918 Lusseau, 2003, The bottlenose dolphin community of doubtful sound features a large proportion of long-lasting associations, Behav. Ecol. Sociobiol., 54, 396, 10.1007/s00265-003-0651-y Chalupa, 2017, Computational methods for finding long simple cycles in complex networks, Knowl.-Based Syst., 125, 96, 10.1016/j.knosys.2017.03.022 Chalupa, 2017, Mining k-reachable sets in real-world networks using domination in shortcut graphs, J. Comput. Sci., 22, 1, 10.1016/j.jocs.2017.07.012 Barabási, 1999, Emergence of scaling in random networks, Science, 286, 509, 10.1126/science.286.5439.509 Albert, 2002, Statistical mechanics of complex networks, Rev. Mod. Phys., 74, 47, 10.1103/RevModPhys.74.47 Zachary, 1977, An information flow model for conflict and fission in small groups, J. Anthropol. Res., 33, 452, 10.1086/jar.33.4.3629752