fast local community detection networks: parameterizing graph optimization by How modular structure can simplify tasks on

[1]  Rolf Niedermeier,et al.  Invitation to Fixed-Parameter Algorithms , 2006 .

[2]  Sumeet Agarwal,et al.  Networks in nature : dynamics, evolution, and modularity , 2012 .

[3]  Raj Rao Nadakuditi,et al.  Graph spectra and the detectability of community structure in networks , 2012, Physical review letters.

[4]  Edward T. Bullmore,et al.  Modular and Hierarchically Modular Organization of Brain Networks , 2010, Front. Neurosci..

[5]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[6]  A. Clauset.  Finding local community structure in networks. , 2005, Physical review. E, Statistical, nonlinear, and soft matter physics.

[7]  Mason A. Porter,et al.  Communities in Networks , 2009, ArXiv.

[8]  Jari Saramäki,et al.  Characterizing the Community Structure of Complex Networks , 2010, PloS one.

[9]  James H. Brown,et al.  A General Model for the Origin of Allometric Scaling Laws in Biology , 1997, Science.

[10]  W. König,et al.  A Survey of One-Dimensional Random Polymers , 2001 .

[11]  Cristopher Moore,et al.  Phase transition in the detection of modules in sparse networks , 2011, Physical review letters.

[12]  Erik Jan van Leeuwen,et al.  Faster Algorithms on Branch and Clique Decompositions , 2010, MFCS.

[13]  M E J Newman,et al.  Finding and evaluating community structure in networks. , 2003, Physical review. E, Statistical, nonlinear, and soft matter physics.

[14]  Mark Newman,et al.  Networks: An Introduction , 2010 .

[15]  N. Madras,et al.  THE SELF-AVOIDING WALK , 2006 .

[16]  Cristopher Moore,et al.  Asymptotic analysis of the stochastic block model for modular networks and its algorithmic applications , 2011, Physical review. E, Statistical, nonlinear, and soft matter physics.

[17]  Bruno Courcelle,et al.  Upper bounds to the clique width of graphs , 2000, Discret. Appl. Math..

[18]  Jukka-Pekka Onnela,et al.  Taxonomies of networks from community structure. , 2012, Physical review. E, Statistical, nonlinear, and soft matter physics.

[19]  Jean-Claude Bermond.  On hamiltonian walks , 1976 .

[20]  S. Kak.  Information, physics, and computation , 1996 .

[21]  F. Radicchi,et al.  Complex networks renormalization: flows and fixed points. , 2008, Physical review letters.

[22]  Dániel Marx,et al.  Clustering with local restrictions , 2011, Inf. Comput..

[23]  Bruno Courcelle,et al.  Graph Structure and Monadic Second-Order Logic - A Language-Theoretic Approach , 2012, Encyclopedia of mathematics and its applications.

[24]  Ulrik Brandes,et al.  On Modularity Clustering , 2008, IEEE Transactions on Knowledge and Data Engineering.

[25]  M. Held,et al.  A dynamic programming approach to sequencing problems , 1962, ACM National Meeting.

[26]  Benjamin H. Good,et al.  Performance of modularity maximization in practical contexts. , 2009, Physical review. E, Statistical, nonlinear, and soft matter physics.

[27]  Santo Fortunato,et al.  Community detection in graphs , 2009, ArXiv.

[28]  R. Lambiotte,et al.  Random Walks, Markov Processes and the Multiscale Modular Organization of Complex Networks , 2008, IEEE Transactions on Network Science and Engineering.

[29]  Michael R. Fellows,et al.  Parameterized Complexity , 1998 .

[30]  Stephen T. Hedetniemi,et al.  On Hamiltonian Walks in Graphs , 1974, SIAM J. Comput..

[31]  Eleni Katifori,et al.  Damage and fluctuations induce loops in optimal transport networks. , 2009, Physical review letters.

[32]  HERBERT A. SIMON,et al.  The Architecture of Complexity , 1991 .