Computer Science
Algorithm Design
35%
Betweenness
19%
Betweenness Centrality
44%
Case Study
59%
Community Detection
36%
Complex Networks
42%
Computation Time
26%
Computing Platform
21%
Concurrency
16%
Connected Component
16%
Data Structure
21%
Degree Distribution
19%
Dijkstra Algorithms
21%
Directed Graphs
28%
Distributed Memory
82%
Domain Decomposition
19%
Efficient Implementation
19%
Execution Time
40%
Fast Algorithm
19%
Graph Algorithms
23%
Graph Analytics
64%
Graph Computation
19%
Graph Partition
52%
Massive Datasets
19%
Memory Access Pattern
19%
Memory Architecture
14%
Multicore
100%
Multicore Platform
55%
Multicore Processor
23%
Multicore System
23%
Multipole Method
29%
Optimization Problem
14%
Optimization Technique
19%
Parallel Algorithm
69%
Parallel Implementation
56%
Parallel System
16%
Parallelism
25%
Parallelization
52%
Partitioning Method
42%
Processing Unit
19%
Shared Memory
45%
Shortest Path Problem
36%
SIMD
23%
Small-World Network
21%
Subgraphs
26%
Supercomputer
29%
Symmetric Multi-Processor
16%
Theoretic Analysis
19%
Top Supercomputer
19%
Keyphrases
Algorithm Design
38%
Betweenness Centrality
28%
Bitmap Index
29%
Blue Gene
16%
Breadth-first Search
42%
Centrality Measures
18%
Combinatorial Algorithms
19%
Community Detection
26%
Complex Network Analysis
21%
Compressed Bitmap
19%
Computation Time
16%
Dijkstra
19%
Distributed Storage
32%
Edge Weight
16%
Execution Time
25%
Extreme Scale
19%
Fast multipole Method
29%
Fusion Plasma
23%
Graph Analysis
39%
Graph Analytics
42%
Graph Partitioning
25%
Graph Signal Processing
22%
Gyrokinetics
52%
High Performance
28%
Large Graphs
22%
Large Sparse Graphs
22%
Load Balancing
16%
Memory Efficiency
24%
Memory Graph
29%
Multi-core Parallel
15%
Multicore Platforms
47%
Multicore Processors
18%
Multicore Systems
18%
Parallel Algorithm
35%
Parallel Implementation
33%
Parallelization
28%
Parallelizing
20%
Particle-in-cell
25%
Particle-in-cell Code
18%
Particle-in-cell Method
19%
Partitioning Method
18%
Petascale
18%
Queue Structure
19%
Real-world Graphs
23%
Scientific Computing
15%
Shared Memory
29%
Shortest Path
15%
Single-source Shortest Paths
29%
Small-world Network
19%
Undirected Graph
19%
