Exploring accelerator and parallel graph algorithmic choices for temporal graphs.
Akif RehmanMasab AhmadOmer KhanPublished in: PMAM@PPoPP (2020)
Keyphrases
- graph representation
- graph theory
- parallel implementation
- graph structure
- graph matching
- directed graph
- graph construction
- labeled graphs
- graph databases
- graph search
- graph model
- adjacency matrix
- graph mining
- graph structures
- weighted graph
- subgraph isomorphism
- graph clustering
- graph properties
- series parallel
- bipartite graph
- graph theoretic
- graph partitioning
- graph theoretical
- random graphs
- graph classification
- temporal reasoning
- depth first search
- undirected graph
- dense subgraphs
- dynamic graph
- graph transformation
- spanning tree
- graph representations
- structural pattern recognition
- maximum common subgraph
- evolving graphs
- graph kernels
- graph data
- minimum spanning tree
- reachability queries
- maximum cardinality
- temporal information
- web graph
- planar graphs
- inexact graph matching
- finding the shortest path
- connected components
- graph embedding
- temporal patterns
- graph isomorphism
- polynomial time complexity
- connected dominating set
- structured data
- connected graphs
- massive graphs
- directed acyclic
- graph layout
- edge weights
- topological information
- query graph
- social graphs
- bounded treewidth
- graph drawing
- temporal sequences
- real world graphs
- adjacency graph
- attributed graphs
- maximum clique
- quasi cliques
- maximal cliques
- message passing interface
- attributed relational graph
- association graph
- vertex set
- directed acyclic graph
- neighborhood graph
- graph patterns