-
1
-
-
78650848150
-
Scalable Graph Exploration on Multicore Processors
-
Nov. 2010
-
Agarwal, V. et al. 2010. Scalable Graph Exploration on Multicore Processors. SuperComputing (Nov. 2010).
-
(2010)
SuperComputing
-
-
Agarwal, V.1
-
2
-
-
35348871999
-
Analysis of topological characteristics of huge online social networking services
-
Ahn, Y.-Y. et al. 2007. Analysis of topological characteristics of huge online social networking services. Proceedings of the 16th international conference on World Wide Web - WWW '07 (New York, New York, USA, May. 2007), 835.
-
(2007)
Proceedings of the 16th International Conference on World Wide Web - WWW '07 (New York, New York, USA, May. 2007)
, pp. 835
-
-
Ahn, Y.-Y.1
-
3
-
-
84867490819
-
Linked: How Everything Is Connected to Everything Else and What It Means
-
2003
-
Barabasi, A.-L. 2003. Linked: How Everything Is Connected to Everything Else and What It Means. Recherche. 67, (2003).
-
(2003)
Recherche
, vol.67
-
-
Barabasi, A.-L.1
-
4
-
-
0342521525
-
Scale-free characteristics of random networks: The topology of the world-wide web
-
Jun. 2000
-
Barabási, A.-L. et al. 2000. Scale-free characteristics of random networks: the topology of the world-wide web. Physica A: Statistical Mechanics and its Applications. 281, 1-4 (Jun. 2000), 69-77.
-
(2000)
Physica A: Statistical Mechanics and Its Applications
, vol.281
, Issue.1-4
, pp. 69-77
-
-
Barabási, A.-L.1
-
5
-
-
32344433867
-
R-MAT: A Recursive Model for Graph Mining
-
2004
-
Chakrabarti, D. et al. 2004. R-MAT : A Recursive Model for Graph Mining. SDM (2004).
-
(2004)
SDM
-
-
Chakrabarti, D.1
-
7
-
-
84976857113
-
Algorithm 410 Partial sorting
-
May. 1971
-
Chambers, J.M. 1971. Algorithm 410 Partial sorting. Communications of the ACM. 14, 5 (May. 1971), 357-358.
-
(1971)
Communications of the ACM
, vol.14
, Issue.5
, pp. 357-358
-
-
Chambers, J.M.1
-
9
-
-
79958263695
-
10x10: A General-purpose Architectural Approach to Heterogeneity and Energy Efficiency
-
null (Jan. 2011)
-
Chien, A.A. et al. 2011. 10x10: A General-purpose Architectural Approach to Heterogeneity and Energy Efficiency. Procedia Computer Science. 4, null (Jan. 2011), 1987-1996.
-
(2011)
Procedia Computer Science
, vol.4
, pp. 1987-1996
-
-
Chien, A.A.1
-
10
-
-
0033204106
-
On power-law relationships of the Internet topology
-
DOI 10.1145/316194.316229
-
Faloutsos, M. et al. 1999. On power-law relationships of the Internet topology. ACM SIGCOMM Computer Communication Review. 29, 4 (Oct. 1999), 251-262. (Pubitemid 32081870)
-
(1999)
Computer Communication Review
, vol.29
, Issue.4
, pp. 251-262
-
-
Faloutsos, M.1
Faloutsos, P.2
Faloutsos, C.3
-
11
-
-
84865011730
-
Fast Balanced Partitioning Is Hard Even on Grids and Trees
-
B. Rovan et al., eds. Springer Berlin/Heidelberg
-
Feldmann, A. 2012. Fast Balanced Partitioning Is Hard Even on Grids and Trees. Mathematical Foundations of Computer Science 2012. B. Rovan et al., eds. Springer Berlin/Heidelberg. 372-382.
-
(2012)
Mathematical Foundations of Computer Science 2012
, pp. 372-382
-
-
Feldmann, A.1
-
12
-
-
85028007389
-
Some simplified NP-complete problems
-
Garey, M.R. et al. 1974. Some simplified NP-complete problems. Proceedings of the sixth annual ACM symposium on Theory of computing - STOC '74 (New York, New York, USA, Apr. 1974), 47-63.
-
(1974)
Proceedings of the Sixth Annual ACM Symposium on Theory of Computing - STOC '74 (New York, New York, USA, Apr. 1974)
, pp. 47-63
-
-
Garey, M.R.1
-
13
-
-
84867570222
-
A yoke of oxen and a thousand chickens for heavy lifting graph processing
-
Gharaibeh, A. et al. 2012. A yoke of oxen and a thousand chickens for heavy lifting graph processing. Proceedings of the 21st international conference on Parallel architectures and compilation techniques - PACT '12 (New York, New York, USA, Sep. 2012), 345.
-
(2012)
Proceedings of the 21st International Conference on Parallel Architectures and Compilation Techniques - PACT '12 (New York, New York, USA, Sep. 2012)
, pp. 345
-
-
Gharaibeh, A.1
-
14
-
-
84886413028
-
-
Graph500: 2012. http://www.graph500.org.
-
(2012)
-
-
-
15
-
-
79952811127
-
Accelerating CUDA graph algorithms at maximum warp
-
New York, New York, USA, Feb. 2011
-
Hong, S. et al. 2011. Accelerating CUDA graph algorithms at maximum warp. PPoPP (New York, New York, USA, Feb. 2011).
-
(2011)
PPoPP
-
-
Hong, S.1
-
16
-
-
84856541553
-
Efficient Parallel Graph Exploration on Multi-Core CPU and GPU
-
Oct. 2011
-
Hong, S. et al. 2011. Efficient Parallel Graph Exploration on Multi-Core CPU and GPU. PACT (Oct. 2011).
-
(2011)
PACT
-
-
Hong, S.1
-
17
-
-
36849044168
-
A network analysis of the Italian overnight money market
-
Jan. 2008
-
Iori, G. et al. 2008. A network analysis of the Italian overnight money market. Journal of Economic Dynamics and Control. 32, 1 (Jan. 2008), 259-278.
-
(2008)
Journal of Economic Dynamics and Control
, vol.32
, Issue.1
, pp. 259-278
-
-
Iori, G.1
-
18
-
-
0035799707
-
Lethality and centrality in protein networks
-
May. 2001
-
Jeong, H. et al. 2001. Lethality and centrality in protein networks. Nature. 411, 6833 (May. 2001), 41-2.
-
(2001)
Nature
, vol.411
, Issue.6833
, pp. 41-42
-
-
Jeong, H.1
-
19
-
-
0032131147
-
A Fast and High Quality Multilevel Scheme for Partitioning Irregular Graphs
-
Dec. 1998
-
Karypis, G. and Kumar, V. 1998. A Fast and High Quality Multilevel Scheme for Partitioning Irregular Graphs. SIAM Journal on Scientific Computing. 20, 1 (Dec. 1998).
-
(1998)
SIAM Journal on Scientific Computing
, vol.20
, Issue.1
-
-
Karypis, G.1
Kumar, V.2
-
20
-
-
77953991481
-
All-pairs shortest-paths for large graphs on the GPU
-
Jun. 2008
-
Katz, G.J. and Kider Jr, J.T. 2008. All-pairs shortest-paths for large graphs on the GPU. SIGGRAPH/EUROGRAPHICS. (Jun. 2008).
-
(2008)
SIGGRAPH/EUROGRAPHICS
-
-
Katz, G.J.1
Kider Jr., J.T.2
-
22
-
-
77954723629
-
Pregel: A system for large-scale graph processing
-
Jun. 2010
-
Malewicz, G. et al. 2010. Pregel: a system for large-scale graph processing. SIGMOD (Jun. 2010).
-
(2010)
SIGMOD
-
-
Malewicz, G.1
-
23
-
-
84858391043
-
Scalable GPU Graph Traversal
-
2012
-
Merrill, D. et al. 2012. Scalable GPU Graph Traversal. PPoPP (2012).
-
(2012)
PPoPP
-
-
Merrill, D.1
-
25
-
-
84861848119
-
Community structure and scalefree collections of Erdo{combining double acute accent}s-Rényi graphs
-
May. 2012
-
Seshadhri, C. et al. 2012. Community structure and scalefree collections of Erdo{combining double acute accent}s-Rényi graphs. Physical review. E, Statistical, nonlinear, and soft matter physics. 85, 5-2 (May. 2012), 056109.
-
(2012)
Physical Review. E, Statistical, Nonlinear, and Soft Matter Physics
, vol.85
, Issue.2-5
, pp. 056109
-
-
Seshadhri, C.1
-
26
-
-
14044268098
-
The large-scale structure of semantic networks: Statistical analyses and a model of semantic growth
-
Steyvers, M. and Tenenbaum, J.B. 2005. The large-scale structure of semantic networks: statistical analyses and a model of semantic growth. Cognitive science. 29, 1 (Jan. 2005), 41-78. (Pubitemid 40280365)
-
(2005)
Cognitive Science
, vol.29
, Issue.1
, pp. 41-78
-
-
Steyvers, M.1
Tenenbaum, J.B.2
-
27
-
-
0025467711
-
A bridging model for parallel computation
-
Aug. 1990
-
Valiant, L.G. 1990. A bridging model for parallel computation. Communications of the ACM. 33, 8 (Aug. 1990).
-
(1990)
Communications of the ACM
, vol.33
, Issue.8
-
-
Valiant, L.G.1
-
28
-
-
0942276880
-
Complex networks: Small-world, scale-free and beyond
-
2003
-
Wang, X.F. and Chen, G. 2003. Complex networks: Small-world, scale-free and beyond. IEEE Circuits and Systems Magazine. 3, 1 (2003), 6-20.
-
(2003)
IEEE Circuits and Systems Magazine
, vol.3
, Issue.1
, pp. 6-20
-
-
Wang, X.F.1
Chen, G.2
|