Skip to main navigation
Skip to search
Skip to main content
Illinois Experts Home
LOGIN & Help
Link opens in a new tab
Search content at Illinois Experts
Home
Profiles
Research units
Research & Scholarship
Datasets
Honors
Press/Media
Activities
Edge v. Node Parallelism for Graph Centrality Metrics
Yuntao Jia
, Victor Lu
, Jared Hoberock
, Michael Garland
,
John C. Hart
Siebel School of Computing and Data Science
Research output
:
Chapter in Book/Report/Conference proceeding
›
Chapter
Overview
Fingerprint
Fingerprint
Dive into the research topics of 'Edge v. Node Parallelism for Graph Centrality Metrics'. Together they form a unique fingerprint.
Sort by
Weight
Alphabetically
Keyphrases
Parallelization
100%
Graph Centrality
100%
Parallel Approach
100%
Graphics Processing Unit
40%
Breadth-first Search
40%
Graph Algorithms
40%
Scale-free Network
40%
All-pairs Shortest Paths
40%
Network Applications
20%
Load Balancing
20%
Synchronization Algorithm
20%
Large Graphs
20%
Dense Graphs
20%
Maximum Flow
20%
Centrality Measures
20%
Inter-block
20%
Thread Divergence
20%
Grid Mesh
20%
Degree Variance
20%
Block Synchronization
20%
Computer Science
Parallelism
100%
Centrality Metric
100%
Parallel Approach
100%
Processing Unit
40%
Graph Algorithms
40%
Pair Shortest Path
40%
Load Balancing
20%
Network Application
20%
Thread Divergence
20%