Tigr: Transforming Irregular Graphs for GPU-Friendly Graph Processing.
Amir Hossein Nodehi SabetJunqiao QiuZhijia ZhaoPublished in: ASPLOS (2018)
Keyphrases
- graph representation
- directed graph
- graph theory
- real time
- weighted graph
- graph structure
- graph matching
- graph construction
- labeled graphs
- graph mining
- graph theoretic
- adjacency matrix
- graph theoretical
- graph search
- graph clustering
- graph databases
- graph model
- graph structures
- series parallel
- graph partitioning
- graph classification
- random graphs
- graph data
- spanning tree
- undirected graph
- graph kernels
- dynamic graph
- structural pattern recognition
- minimum spanning tree
- graph representations
- subgraph isomorphism
- graph properties
- graph isomorphism
- bipartite graph
- dense subgraphs
- web graph
- structured data
- parallel computation
- evolving graphs
- connected dominating set
- maximal cliques
- query graph
- edge weights
- social graphs
- link analysis
- reachability queries
- graph layout
- bounded treewidth
- social networks
- maximum common subgraph
- inexact graph matching
- finding the shortest path
- random walk
- quasi cliques
- shortest path
- parallel processing
- graph transformation
- directed acyclic graph
- graphics hardware
- planar graphs
- graph drawing
- real world graphs
- real time rendering