,
,
,
,
,
,
,
,
,
, , vol.6, p.9
,
,
,
,
,
,
,
, , vol.6, p.42
,
,
,
,
,
,
,
,
,
,
,
,
, , vol.134, p.144
, , vol.49, p.52
,
,
,
,
,
,
, , vol.9, p.19
, Énumération de Quasi-Cliques Maximales 48
, , p.61
, , vol.9, p.14
,
,
,
,
,
,
,
,
,
, Massive quasi-clique detection, Latin American Symposium on Theoretical Informatics, pp.598-612, 2002.
, Towards compressing web graphs, Data Compression Conference, pp.203-212, 2001.
, Link communities reveal multiscale complexity in networks, nature, vol.466, issue.7307, p.761, 2010.
, Modeling hiv spread through sexual contact using a cellular automaton, Evolutionary Computation (CEC), pp.2345-2350, 2011.
, Population biology of infectious diseases : Part i, Nature, vol.280, issue.5721, p.361, 1979.
, Analysis of news flow dynamics based on the company co-mention network characteristics, International Workshop on Complex Networks and their Applications, pp.521-533, 2018.
, Topic-aware social influence propagation models, IEEE 12th International Conference on, pp.81-90, 2012.
DOI : 10.1109/icdm.2012.122
, Reactive local search for maximum clique : A new implementation, 2007.
DOI : 10.1007/s004530010074
, Reactive local search for the maximum clique problem 1. Algorithmica, vol.29, pp.610-637, 2001.
DOI : 10.1007/s004530010074
, Securing cyberspace : Identifying key actors in hacker communities, Intelligence and Security Informatics (ISI), 2012 IEEE International Conference on, pp.24-29, 2012.
DOI : 10.1109/isi.2012.6283296
, Exploring threats and vulnerabilities in hacker web : Forums, irc and carding shops, Intelligence and Security Informatics (ISI), 2015 IEEE International Conference on, pp.85-90, 2015.
DOI : 10.1109/isi.2015.7165944
, Computing common intervals of k permutations, with applications to modular decomposition of graphs, SIAM Journal on Discrete Mathematics, vol.22, issue.3, pp.1022-1039, 2008.
, Competitive influence maximization in social networks, International Workshop on Web and Internet Economics, pp.306-311, 2007.
DOI : 10.1007/978-3-540-77105-0_31
URL : http://www-rcf.usc.edu/~dkempe/publications/viral-competitive.pdf
, Fast unfolding of communities in large networks, Journal of statistical mechanics : theory and experiment, issue.10, p.10008, 2008.
, The local threshold for geographical spread of infectious diseases between farms. Preventive veterinary medicine, vol.82, pp.90-101, 2007.
, The webgraph framework i : compression techniques, Proceedings of the 13th international conference on World Wide Web, pp.595-602, 2004.
DOI : 10.1145/988672.988752
, On modularity clustering, IEEE transactions on knowledge and data engineering, vol.20, issue.2, pp.172-188, 2008.
DOI : 10.1109/tkde.2007.190689
URL : https://kops.uni-konstanz.de/bitstream/123456789/5853/1/modularity.pdf
, Algorithm 457 : finding all cliques of an undirected graph, Communications of the ACM, vol.16, issue.9, pp.575-577, 1973.
, On effectively finding maximal quasi-cliques in graphs, Learning and Intelligent Optimization, pp.41-55, 2007.
, Liquidity coinsurance, moral hazard, and financial contagion, The Journal of Finance, vol.62, issue.5, pp.2275-2302, 2007.
, Trust-based dynamic linear threshold models for non-competitive and competitive influence propagation, 2018.
, A generalized and adaptive method for community detection, 2014.
, Decompositions de graphes et permutations factorisantes, 1997.
, Graph decompositions and factorizing permutations, Discrete Mathematics and Theoretical Computer Science, vol.5, issue.1, pp.55-70, 2002.
URL : https://hal.archives-ouvertes.fr/hal-00958972
, Systemic risk, contagion, and financial networks : A survey, 2015.
, Finding local community structure in networks, Physical review E, vol.72, issue.2, p.26132, 2005.
, Mapreduce : simplified data processing on large clusters, Communications of the ACM, vol.51, issue.1, pp.107-113, 2008.
, Listing all maximal cliques in large sparse real-world graphs, Experimental Algorithms, pp.364-375, 2011.
, On random graphs i, Publ. Math. Debrecen, vol.6, pp.290-297, 1959.
, On chromatic number of graphs and set-systems, Acta Mathematica Academiae Scientiarum Hungarica, vol.17, issue.1-2, pp.61-99, 1966.
, Line graphs, link partitions, and overlapping communities, Physical Review E, vol.80, issue.1, p.16105, 2009.
, Simple and fast : Improving a branch-and-bound algorithm for maximum clique, European Symposium on Algorithms, pp.485-498, 2002.
, Graph clustering and minimum cut trees, Internet Mathematics, vol.1, issue.4, pp.385-408, 2004.
, Community detection in graphs, Physics reports, vol.486, issue.3-5, pp.75-174, 2010.
, Transitiv orientierbare graphen, Acta Mathematica Hungarica, vol.18, issue.1, pp.25-66, 1967.
, Structure and evolution of the global seafood trade network, Environmental Research Letters, vol.10, issue.12, p.125014, 2015.
, Random graphs, The Annals of Mathematical Statistics, vol.30, issue.4, pp.1141-1144, 1959.
, Community structure in social and biological networks. Proceedings of the national academy of sciences, vol.99, pp.7821-7826, 2002.
, Tabu search-part i, ORSA Journal on computing, vol.1, issue.3, pp.190-206, 1989.
, Tabu search-part ii, ORSA Journal on computing, vol.2, issue.1, pp.4-32, 1990.
, Talk of the network : A complex systems look at the underlying process of word-of-mouth, Marketing letters, vol.12, issue.3, pp.211-223, 2001.
, Learning influence probabilities in social networks, Proceedings of the third ACM international conference on Web search and data mining, pp.241-250, 2010.
, Competitive contagion in networks, Games and Economic Behavior, 2014.
, Threshold models of collective behavior, American journal of sociology, vol.83, issue.6, pp.1420-1443, 1978.
, Dominance and association among members of a captive and a free-ranging group of grey kangaroos (macropus giganteus), Animal Behaviour, vol.21, issue.3, pp.449-456, 1973.
, Kangaroo network dataset -KONECT, 2016.
, Targeted and budgeted influence maximization in social networks under deterministic linear threshold model, 2018.
, A simple linear-time modular decomposition algorithm for graphs, using order extension, Algorithm Theory-SWAT 2004, pp.187-198, 2004.
URL : https://hal.archives-ouvertes.fr/hal-00159601
, A survey of the algorithmic aspects of modular decomposition, Computer Science Review, vol.4, issue.1, pp.41-59, 2010.
, Partition refinement techniques : An interesting algorithmic tool kit, International Journal of Foundations of Computer Science, vol.10, issue.02, pp.147-170, 1999.
, Exploring network structure, dynamics, and function using networkx, Los Alamos National Lab.(LANL), 2008.
, New spectral methods for ratio cut partitioning and clustering, IEEE transactions on computer-aided design of integrated circuits and systems, vol.11, issue.9, pp.1074-1085, 1992.
, Some properties of line digraphs. Rendiconti del Circolo Matematico di Palermo, vol.9, pp.161-168, 1960.
, The mathematics of infectious diseases, SIAM review, vol.42, issue.4, pp.599-653, 2000.
, Growing scale-free networks with tunable clustering, Physical review E, vol.65, issue.2, p.26107, 2002.
, Diffusion in social networks : A multiagent perspective, IEEE Transactions on Systems, Man, and Cybernetics : Systems, vol.45, issue.2, pp.198-213, 2015.
, Percolation approach to simulation of a sustainable network economy structure, Entrepreneurship and Sustainability Issues, vol.5, issue.3, pp.502-513, 2018.
URL : https://hal.archives-ouvertes.fr/hal-01773587
, Reducibility among combinatorial problems, 1972.
, Maximizing the spread of influence through a social network, Proceedings of the ninth ACM SIGKDD international conference on Knowledge discovery and data mining, pp.137-146, 2003.
, Maximizing the spread of influence through a social network, Theory OF Computing, vol.11, issue.4, pp.105-147, 2015.
, Network science : a useful tool in economics and finance, Mind & Society, vol.14, issue.2, pp.155-167, 2015.
, Contributions to the mathematical theory of epidemics. ii.-the problem of endemicity, Proc. R. Soc. Lond. A, vol.138, pp.55-83, 1932.
, An efficient heuristic procedure for partitioning graphs. The Bell system technical journal, vol.49, pp.291-307, 1970.
, Generating random regular graphs, Proceedings of the thirty-fifth annual ACM symposium on Theory of computing, pp.213-222, 2003.
, Optimization by simulated annealing. science, vol.220, pp.671-680, 1983.
, Least squares method for diffusion source localization in complex networks, International Workshop on Complex Networks and their Applications, pp.473-485, 2016.
, Generating all maximal independent sets : Np-hardness and polynomial-time algorithms, SIAM Journal on Computing, vol.9, issue.3, pp.558-565, 1980.
, The dynamics of viral marketing, ACM Transactions on the Web (TWEB), vol.1, issue.1, p.5, 2007.
, SNAP Datasets : Stanford large network dataset collection, 2014.
, Snap : A general-purpose network analysis and graph-mining library, ACM Transactions on Intelligent Systems and Technology (TIST), vol.8, issue.1, p.1, 2016.
, Labeled influence maximization in social networks for target marketing, Privacy, Security, Risk and Trust (PASSAT) and 2011 IEEE Third Inernational Conference on Social Computing (SocialCom), pp.560-563, 2011.
, Real-time targeted influence maximization for online advertisements, Proceedings of the VLDB Endowment, vol.8, pp.1070-1081, 2015.
, Ioannis Katakis, and Dimitrios Gunopulos. Real-time and costeffective limitation of misinformation propagation, 17th IEEE International Conference on Mobile Data Management (MDM), pp.158-163, 2016.
, Immunization strategy based on the critical node in percolation transition, Physics Letters A, vol.379, pp.2795-2801, 2015.
, Approximation and inapproximation for the influence maximization problem in social networks under deterministic linear threshold model, Distributed Computing Systems Workshops (ICDCSW), pp.160-165, 2011.
, Pregel : a system for large-scale graph processing, Proceedings of the 2010 ACM SIGMOD International Conference on Management of data, pp.135-146, 2010.
, Clustering and community detection in directed networks : A survey, Physics Reports, vol.533, issue.4, pp.95-142, 2013.
, Classifying molecular sequences using a linkage graph with their pairwise similarities, Theoretical Computer Science, vol.210, issue.2, pp.305-325, 1999.
, Modular decomposition and transitive orientation, Discrete Mathematics, vol.201, issue.1, pp.189-241, 1999.
, Spheres of influence for more effective viral marketing, Proceedings of the 2016 International Conference on Management of Data, pp.711-726, 2016.
, Multi-layered interbank model for assessing systemic risk, 2016.
, Graph summarization with bounded error, Proceedings of the 2008 ACM SIGMOD international conference on Management of data, pp.419-432, 2008.
, Modularity and community structure in networks, Proceedings of the national academy of sciences, vol.103, pp.8577-8582, 2006.
, Finding and evaluating community structure in networks, Physical review E, vol.69, issue.2, p.26113, 2004.
, Renormalization group analysis of the small-world network model, Physics Letters A, vol.263, issue.4-6, pp.341-346, 1999.
, Epidemic processes in complex networks, Reviews of modern physics, vol.87, issue.3, p.925, 2015.
DOI : 10.1103/revmodphys.87.925
URL : https://link.aps.org/accepted/10.1103/RevModPhys.87.925
, Fast algorithms for the maximum clique problem on massive sparse graphs, Algorithms and Models for the Web Graph, pp.156-169, 2013.
, Collective influence maximization in threshold models of information cascading with first-order transitions, 2016.
, Exact algorithms for maximum clique : A computational study, Algorithms, vol.5, issue.4, pp.545-587, 2012.
DOI : 10.3390/a5040545
URL : https://www.mdpi.com/1999-4893/5/4/545/pdf
, Graph theory approaches to protein interaction data analysis. proteins, vol.120, p.0, 2003.
, Dynamic local search for the maximum clique problem, Journal of Artificial Intelligence Research, vol.25, pp.159-185, 2006.
, The network data repository with interactive graph analytics and visualization, Proceedings of the Twenty-Ninth AAAI Conference on Artificial Intelligence, 2015.
, Exploring community structure in biological networks with random graphs, BMC bioinformatics, vol.15, issue.1, p.220, 2014.
, Identifying influential spreaders by graph sampling, International Workshop on Complex Networks and their Applications, pp.111-122, 2016.
DOI : 10.1007/978-3-319-50901-3_9
, An exact bit-parallel algorithm for the maximum clique problem, Computers & Operations Research, vol.38, issue.2, pp.571-581, 2011.
, War on anonymous : British spies attacked cybercriminals, snowden docs show, 2014.
, Real-time irc threat detection framework, Foundations and Applications of Self* Systems, pp.318-323, 2017.
DOI : 10.1109/fas-w.2017.166
, Normalized cuts and image segmentation, IEEE Transactions, vol.22, issue.8, pp.888-905, 2000.
, Fast algorithm for modularity-based graph clustering, AAAI, pp.1170-1176, 2013.
, Threshold-limited spreading in social networks with multiple initiators, Scientific reports, vol.3, p.2330, 2013.
, Site du projet spark de la fondation apache, pp.17-29
, Site du stanford network analysis project, qui propose une librairie c++ pour la manipulation de graphes, pp.4-12
, Generating random regular graphs quickly, Combinatorics, Probability and Computing, vol.8, issue.4, pp.377-396, 1999.
, Mining maximal cliques from a large graph using mapreduce : Tackling highly uneven subproblem sizes, Journal of Parallel and Distributed Computing, vol.79, pp.104-114, 2015.
, Efficient aggregation for graph summarization, Proceedings of the 2008 ACM SIGMOD international conference on Management of data, pp.567-580, 2008.
, Compression of weighted graphs, Proceedings of the 17th ACM SIGKDD international conference on Knowledge discovery and data mining, pp.965-973, 2011.
, An efficient branch-and-bound algorithm for finding a maximum clique with computational experiments, Journal of Global optimization, vol.37, issue.1, pp.95-111, 2007.
, An efficient branch-and-bound algorithm for finding a maximum clique, Discrete mathematics and theoretical computer science, pp.278-289, 2003.
, A simple and faster branch-and-bound algorithm for finding a maximum clique, International Workshop on Algorithms and Computation, pp.191-203, 2010.
, The worst-case time complexity for generating all maximal cliques and computational experiments, Theoretical Computer Science, vol.363, issue.1, pp.28-42, 2006.
, Alexander Schönhuth, and Niko Beerenwinkel. Viral quasispecies assembly via maximal clique enumeration, PLoS computational biology, vol.10, issue.3, p.1003515, 2014.
, Threshold driven contagion on weighted networks. Scientific reports, vol.8, issue.1, p.3094, 2018.
, An efficient algorithm for solving pseudo clique enumeration problem, Algorithmica, vol.56, issue.1, pp.3-16, 2010.
, Collective dynamics of 'small-world'networks. nature, vol.393, p.440, 1998.
, An upper bound for the chromatic number of a graph and its application to timetabling problems, The Computer Journal, vol.10, issue.1, pp.85-86, 1967.
, Graphx : A resilient distributed graph system on spark, First International Workshop on Graph Data Management Experiences and Systems, 2013.
, Minimizing the influence propagation in social networks for linear threshold models, vol.50, pp.14465-14470, 2017.
URL : https://hal.archives-ouvertes.fr/hal-01786070
, Parallel metagenomic sequence clustering via sketching and maximal quasi-clique enumeration on map-reduce clouds, Parallel & Distributed Processing Symposium (IPDPS), pp.1223-1233, 2011.