-
1
-
-
0003895164
-
-
Springer, 2nd edition
-
G. Ausiello, P. Crescenzi, G. Gambosi, V. Kann, and A. Marchetti- Spaccamela. Complexity and Approximation - Combinatorial Optimization Problems and Their Approximability Properties. Springer, 2nd edition, 2002.
-
(2002)
Complexity and Approximation - Combinatorial Optimization Problems and Their Approximability Properties
-
-
Ausiello, G.1
Crescenzi, P.2
Gambosi, G.3
Kann, V.4
Marchettispaccamela, A.5
-
2
-
-
56349094785
-
Fast unfolding of communities in large networks
-
2008
-
V. Blondel, J.-L. Guillaume, R. Lambiotte, and E. Lefebvre. Fast unfolding of communities in large networks. Journal of Statistical Mechanics: Theory and Experiment, 2008(10), 2008.
-
(2008)
Journal of Statistical Mechanics: Theory and Experiment
, vol.10
-
-
Blondel, V.1
Guillaume, J.-L.2
Lambiotte, R.3
Lefebvre, E.4
-
3
-
-
37648998882
-
On Modularity Clustering
-
February
-
U. Brandes, D. Delling, M. Gaertler, R. Görke, M. Höfer, Z. Nikoloski, and D. Wagner. On Modularity Clustering. IEEE Transactions on Knowledge and Data Engineering, 20(2):172-188, February 2008.
-
(2008)
IEEE Transactions On Knowledge and Data Engineering
, vol.20
, Issue.2
, pp. 172-188
-
-
Brandes, U.1
Delling, D.2
Gaertler, M.3
Görke, R.4
Höfer, M.5
Nikoloski, Z.6
Wagner, D.7
-
4
-
-
38549153704
-
On Finding Graph Clusterings with Maximum Modularity
-
In A. Brandstädt, D. Kratsch, and H. Müller, editors, Springer, October
-
U. Brandes, D. Delling, M. Höfer, M. Gaertler, R. Görke, Z. Nikoloski, and D. Wagner. On Finding Graph Clusterings with Maximum Modularity. In A. Brandstädt, D. Kratsch, and H. Müller, editors, Proceedings of the 33rd International Workshop on Graph-Theoretic Concepts in Computer Science (WG'07), volume 4769 of Lecture Notes in Computer Science, pages 121-132. Springer, October 2007.
-
(2007)
Proceedings of The 33rd International Workshop On Graph-Theoretic Concepts In Computer Science (WG'07), Volume 4769 of Lecture Notes In Computer Science
, pp. 121-132
-
-
Brandes, U.1
Delling, D.2
Höfer, M.3
Gaertler, M.4
Görke, R.5
Nikoloski, Z.6
Wagner, D.7
-
5
-
-
33744964300
-
Network Analysis: Methodological Foundations
-
U. Brandes and T. Erlebach, editors, Springer, February
-
U. Brandes and T. Erlebach, editors. Network Analysis: Methodological Foundations, volume 3418 of Lecture Notes in Computer Science. Springer, February 2005.
-
(2005)
Lecture Notes In Computer Science
, vol.3418
-
-
-
6
-
-
0142214892
-
Experiments on Graph Clustering Algorithms. In Proceedings of the 11th Annual European Symposium on Algorithms (ESA'03)
-
Springer
-
U. Brandes, M. Gaertler, and D. Wagner. Experiments on Graph Clustering Algorithms. In Proceedings of the 11th Annual European Symposium on Algorithms (ESA'03), volume 2832 of Lecture Notes in Computer Science, pages 568-579. Springer, 2003.
-
(2003)
Lecture Notes In Computer Science
, vol.2832
, pp. 568-579
-
-
Brandes, U.1
Gaertler, M.2
Wagner, D.3
-
10
-
-
0038763983
-
Connected Components in Random Graphs Graphs with Given Expected Degree Sequences
-
F. R. K. Chung and L. Lu. Connected Components in Random Graphs Graphs with Given Expected Degree Sequences. Annals of Combinatorics, 6(2):125-145, 2002.
-
(2002)
Annals of Combinatorics
, vol.6
, Issue.2
, pp. 125-145
-
-
Chung, F.R.K.1
Lu, L.2
-
11
-
-
41349117788
-
Finding community structure in very large networks
-
066111
-
A. Clauset, M. E. J. Newman, and C. Moore. Finding community structure in very large networks. Physical Review E, 70(066111), 2004.
-
(2004)
Physical Review E
, vol.70
-
-
Clauset, A.1
Newman, M.E.J.2
Moore, C.3
-
12
-
-
0028484228
-
The Complexity of Multiterminal Cuts
-
E. Dahlhaus, D. S. Johnson, C. H. Papadimitriou, P. D. Seymour, and M. Yannakakis. The Complexity of Multiterminal Cuts. SIAM Journal on Computing, 23(4):864-894, 1994.
-
(1994)
SIAM Journal On Computing
, vol.23
, Issue.4
, pp. 864-894
-
-
Dahlhaus, E.1
Johnson, D.S.2
Papadimitriou, C.H.3
Seymour, P.D.4
Yannakakis, M.5
-
13
-
-
26244464025
-
-
P09008
-
L. Danon, A. Díaz-Guilera, J. Duch, and A. Arenas. Comparing Community Structure Identification. Journal of Statistical Mechanics: Theory and Experiment, 09(P09008):1-10, 2005.
-
(2005)
Comparing Community Structure Identification. Journal of Statistical Mechanics: Theory and Experiment
, vol.9
, pp. 1-10
-
-
Danon, L.1
Díaz-Guilera, A.2
Duch, J.3
Arenas, A.4
-
14
-
-
27244441304
-
Community Detection in Complex Networks using Extremal Optimization
-
027104
-
J. Duch and A. Arenas. Community Detection in Complex Networks using Extremal Optimization. Physical Review E, 72(027104):1-4, 2005.
-
(2005)
Physical Review E
, vol.72
, pp. 1-4
-
-
Duch, J.1
Arenas, A.2
-
16
-
-
38149006963
-
Significance-Driven Graph Clustering
-
Springer, June
-
M. Gaertler, R. Görke, and D. Wagner. Significance-Driven Graph Clustering. In Proceedings of the 3rd International Conference on Algorithmic Aspects in Information and Management (AAIM'07), Lecture Notes in Computer Science, pages 11-26. Springer, June 2007.
-
(2007)
Proceedings of The 3rd International Conference On Algorithmic Aspects In Information and Management (AAIM'07), Lecture Notes In Computer Science
, pp. 11-26
-
-
Gaertler, M.1
Görke, R.2
Wagner, D.3
-
18
-
-
14644396645
-
Functional Cartography of Complex Metabolic Networks
-
February
-
R. Guimerà and L. A. N. Amaral. Functional Cartography of Complex Metabolic Networks. Nature, 433:895-900, February 2005.
-
(2005)
Nature
, vol.433
, pp. 895-900
-
-
Guimerà, R.1
Amaral, L.A.N.2
-
20
-
-
0034497389
-
On Clusterings - Good, Bad and Spectral
-
R. Kannan, S. Vempala, and A. Vetta. On Clusterings - Good, Bad and Spectral. In Proceedings of the 41st Annual IEEE Symposium on Foundations of Computer Science (FOCS'00), pages 367-378, 2000.
-
(2000)
In Proceedings of The 41st Annual IEEE Symposium On Foundations of Computer Science (FOCS'00)
, pp. 367-378
-
-
Kannan, R.1
Vempala, S.2
Vetta, A.3
-
21
-
-
28844495055
-
Local Modularity Measure for Network Clusterizations
-
056107
-
S. Muff, F. Rao, and A. Caflisch. Local Modularity Measure for Network Clusterizations. Physical Review E, 72(056107):1-4, 2005.
-
(2005)
Physical Review E
, vol.72
, pp. 1-4
-
-
Muff, S.1
Rao, F.2
Caflisch, A.3
-
22
-
-
84864626317
-
Optimisation of Clustering Algorithms for the Identification of Customer Profiles from Shopping Cart Data
-
October, Diplomarbeit In- formatik
-
S. Nagel. Optimisation of Clustering Algorithms for the Identification of Customer Profiles from Shopping Cart Data. Master's thesis, Universität Karlsruhe (TH), Fakultät für Informatik, October 2008. Diplomarbeit In- formatik.
-
(2008)
Master's Thesis, Universität Karlsruhe (TH), Fakultät Für Informatik
-
-
Nagel, S.1
-
23
-
-
41349096036
-
Analysis of Weighted Networks
-
056131
-
M. E. J. Newman. Analysis of Weighted Networks. Physical Review E, 70(056131):1-9, 2004.
-
(2004)
Physical Review E
, vol.70
, pp. 1-9
-
-
Newman, M.E.J.1
-
24
-
-
42749100809
-
Fast Algorithm for Detecting Community Structure in Networks
-
M. E. J. Newman. Fast Algorithm for Detecting Community Structure in Networks. Physical Review E, 69:066133, 2004.
-
(2004)
Physical Review E
, vol.69
, pp. 066133
-
-
Newman, M.E.J.1
-
26
-
-
37649028224
-
Finding and evaluating community structure in networks
-
026113
-
M. E. J. Newman and M. Girvan. Finding and evaluating community structure in networks. Physical Review E, 69(026113), 2004.
-
(2004)
Physical Review E
, vol.69
-
-
Newman, M.E.J.1
Girvan, M.2
-
27
-
-
33748286498
-
Origin of degree correlations in the Internet and other networks
-
M. E. J. Newman and J. Park. Origin of degree correlations in the Internet and other networks. Physical Review E, 68(2), 2003.
-
(2003)
Physical Review E
, vol.68
, Issue.2
-
-
Newman, M.E.J.1
Park, J.2
-
28
-
-
65449162307
-
Extending the Definition of Modularity to Directed Graphs with Overlapping Communities
-
(03):p03024 (23pp), 2009
-
V. Nicosia, G. Mangioni, V. Carchiolo, and M. Malgeri. Extending the Definition of Modularity to Directed Graphs with Overlapping Communities. Journal of Statistical Mechanics: Theory and Experiment, 2009(03):p03024 (23pp), 2009.
-
(2009)
Journal of Statistical Mechanics: Theory and Experiment
-
-
Nicosia, V.1
Mangioni, G.2
Carchiolo, V.3
Malgeri, M.4
-
29
-
-
33749677706
-
Spatially Constrained Networks and the Evolution of Modular Control Systems
-
Springer
-
A. Philippides, P. Fine, and E. D. Paolo. Spatially Constrained Networks and the Evolution of Modular Control Systems. In Proc. 9th International Conference on Simulation of Adaptive Behavior, Lecture Notes in Computer Science, pages 546-557. Springer, 2006.
-
(2006)
In Proc. 9th International Conference On Simulation of Adaptive Behavior, Lecture Notes In Computer Science
, pp. 546-557
-
-
Philippides, A.1
Fine, P.2
Paolo, E.D.3
-
30
-
-
33746227724
-
Statistical Mechanics of Community Detection
-
016110
-
J. Reichardt and S. Bornholdt. Statistical Mechanics of Community Detection. Physical Review E, 74(016110):1-16, 2006.
-
(2006)
Physical Review E
, vol.74
, pp. 1-16
-
-
Reichardt, J.1
Bornholdt, S.2
-
34
-
-
42449110882
-
An Information Flow Model for Conflict and Fission in Small Groups
-
W. W. Zachary. An Information Flow Model for Conflict and Fission in Small Groups. Journal of Anthropological Research, 33:452-473, 1977.
-
(1977)
Journal of Anthropological Research
, vol.33
, pp. 452-473
-
-
Zachary, W.W.1
-
35
-
-
45849155039
-
Information-Theoretic Ap- proach to Network Modularity
-
046117
-
E. Ziv, M. Middendorf, and C. H. Wiggins. Information-Theoretic Ap- proach to Network Modularity. Physical Review E, 71(046117):1-9, 2005.
-
(2005)
Physical Review E
, vol.71
, pp. 1-9
-
-
Ziv, E.1
Middendorf, M.2
Wiggins, C.H.3
|