-
2
-
-
0036346132
-
The origin of power laws in internet topologies revisited
-
IEEE, Los Alamitos
-
Chen, Q., Chang, H., Govindan, R., Jamin, S.: The origin of power laws in internet topologies revisited. In: Proceedings of INFOCOM 2002, vol. 2, pp. 608-617. IEEE, Los Alamitos (2002)
-
(2002)
Proceedings of INFOCOM
, vol.2
, pp. 608-617
-
-
Chen, Q.1
Chang, H.2
Govindan, R.3
Jamin, S.4
-
3
-
-
13844310836
-
Peeling the yeast protein network
-
Wuchty, S., Almaas, E.: Peeling the yeast protein network. Proteomics 5(2), 444-449 (2005)
-
(2005)
Proteomics
, vol.5
, Issue.2
, pp. 444-449
-
-
Wuchty, S.1
Almaas, E.2
-
4
-
-
0035799707
-
Lethality and Centrality in Protein Networks
-
brief communications
-
Jeong, H., Mason, S.P., Barabasi, A.L., Oltvai, Z.N.: Lethality and Centrality in Protein Networks. Nature 411 (2001) (brief communications)
-
(2001)
Nature
, vol.411
-
-
Jeong, H.1
Mason, S.P.2
Barabasi, A.L.3
Oltvai, Z.N.4
-
5
-
-
33745862770
-
Alone Together?: Exploring the Social Dynamics of Massively Multiplayer Online Games
-
ACM Press, New York
-
Ducheneaut, N., Yee, N., Nickell, E., Moore, R.J.: "Alone Together?": Exploring the Social Dynamics of Massively Multiplayer Online Games. In: CHI 2006. Proceedings of the SIGCHI conference on Human Factors in computing systems, pp. 407-416. ACM Press, New York (2006)
-
(2006)
CHI 2006. Proceedings of the SIGCHI conference on Human Factors in computing systems
, pp. 407-416
-
-
Ducheneaut, N.1
Yee, N.2
Nickell, E.3
Moore, R.J.4
-
6
-
-
32344436210
-
Graphs over time: Densification laws, shrinking diameters and possible explanations
-
ACM Press, New York
-
Leskovec, J., Kleinberg, J., Faloutsos, C.: Graphs over time: densification laws, shrinking diameters and possible explanations. In: KDD 2005. Proceeding of the eleventh ACM SIGKDD international conference on Knowledge discovery in data mining, pp. 177-187. ACM Press, New York (2005)
-
(2005)
KDD 2005. Proceeding of the eleventh ACM SIGKDD international conference on Knowledge discovery in data mining
, pp. 177-187
-
-
Leskovec, J.1
Kleinberg, J.2
Faloutsos, C.3
-
7
-
-
0038483826
-
Emergence of scaling in random networks
-
Barabási, A.L., Albert, R.: Emergence of scaling in random networks. Science 286, 509-512 (1999)
-
(1999)
Science
, vol.286
, pp. 509-512
-
-
Barabási, A.L.1
Albert, R.2
-
8
-
-
85028479137
-
-
Clauset, A., Newman, M.E.J., Moore, C.: Finding community structure in very large networks. Phys. Rev. E 70 (066111) (2004)
-
Clauset, A., Newman, M.E.J., Moore, C.: Finding community structure in very large networks. Phys. Rev. E 70 (066111) (2004)
-
-
-
-
9
-
-
33646840405
-
Network Analysis
-
Brandes, U, Erlebach, T, eds, Springer, Heidelberg
-
Brandes, U., Erlebach, T. (eds.): Network Analysis. LNCS, vol. 3418. Springer, Heidelberg (2005)
-
(2005)
LNCS
, vol.3418
-
-
-
11
-
-
24144434716
-
-
Baur, M., Brandes, U., Gaertler, M., Wagner, D.: Drawing the AS Graph in 2.5 Dimensions. In: Pach, J. (ed.) GD 2004. LNCS, 3383, pp. 43-48. Springer, Heidelberg (2005)
-
Baur, M., Brandes, U., Gaertler, M., Wagner, D.: Drawing the AS Graph in 2.5 Dimensions. In: Pach, J. (ed.) GD 2004. LNCS, vol. 3383, pp. 43-48. Springer, Heidelberg (2005)
-
-
-
-
12
-
-
84864040903
-
-
Alvarez-Hamelin, J.I., Dall'Asta, L., Barrat, A., Vespignani, A.: Large scale networks fingerprinting and visualization using the k-core decomposition. In: NIPS (2005)
-
Alvarez-Hamelin, J.I., Dall'Asta, L., Barrat, A., Vespignani, A.: Large scale networks fingerprinting and visualization using the k-core decomposition. In: NIPS (2005)
-
-
-
-
13
-
-
0000488788
-
Network Structure and Minimum Degree
-
Seidman, S.B.: Network Structure and Minimum Degree. Social Networks 5, 269-287 (1983)
-
(1983)
Social Networks
, vol.5
, pp. 269-287
-
-
Seidman, S.B.1
-
14
-
-
49949098600
-
-
Freeman, L.C.: A Set of Measures of Centrality Based Upon Betweeness. Sociometry 40, 35-41 (1977)
-
Freeman, L.C.: A Set of Measures of Centrality Based Upon Betweeness. Sociometry 40, 35-41 (1977)
-
-
-
-
15
-
-
8344254420
-
Reach-based routing: A new approach to shortest path algorithms optimized for road networks
-
Gutman, R.: Reach-based routing: A new approach to shortest path algorithms optimized for road networks. In: 6th Workshop on Algorithm Engineering and Experiments, pp. 100-111 (2004)
-
(2004)
6th Workshop on Algorithm Engineering and Experiments
, pp. 100-111
-
-
Gutman, R.1
-
17
-
-
84957542241
-
-
Frick, A., Ludwig, A., Mehldau, H.: A fast adaptive layout algorithm for undirected graphs. In: Tamassia, R., Tollis, I(Y.) G. (eds.) GD 1994, LNCS, 894, pp. 388-403. Springer, Heidelberg (1995)
-
Frick, A., Ludwig, A., Mehldau, H.: A fast adaptive layout algorithm for undirected graphs. In: Tamassia, R., Tollis, I(Y.) G. (eds.) GD 1994, LNCS, vol. 894, pp. 388-403. Springer, Heidelberg (1995)
-
-
-
-
18
-
-
0030264246
-
Drawing graphs nicely using simulated annealing
-
Davidson, R., Harel, D.: Drawing graphs nicely using simulated annealing. ACM Trans. Graph. 15(4), 301-331 (1996)
-
(1996)
ACM Trans. Graph
, vol.15
, Issue.4
, pp. 301-331
-
-
Davidson, R.1
Harel, D.2
-
19
-
-
0004061989
-
-
Prentice-Hall, Englewood Cliffs
-
Battista, G.D., Eades, P., Tamassia, R., Tollis, I.G.: Graph Drawing: Algorithms for the Visualization of Graphs. Prentice-Hall, Englewood Cliffs (1999)
-
(1999)
Graph Drawing: Algorithms for the Visualization of Graphs
-
-
Battista, G.D.1
Eades, P.2
Tamassia, R.3
Tollis, I.G.4
-
20
-
-
0034836055
-
BRITE: An Approach to Universal Topology Generation
-
Analysis and Simulation of Computer and Tele, 2001
-
Medina, A., Lakhina, A., Matta, I., Byers, J.: BRITE: An Approach to Universal Topology Generation. In: Proceedings of the International Symposium on Modeling, Analysis and Simulation of Computer and Tele. (2001)
-
Proceedings of the International Symposium on Modeling
-
-
Medina, A.1
Lakhina, A.2
Matta, I.3
Byers, J.4
|