iPregel: Strategies to Deal with an Extreme Form of Irregularity in Vertex-Centric Graph Processing.
Ludovic Anthony Richard CapelliNick BrownJonathan Mark BullPublished in: IA3@SC (2019)
Keyphrases
- directed graph
- hamiltonian cycle
- structured data
- minimum weight
- graph model
- labeled graphs
- bipartite graph
- undirected graph
- maximum cardinality
- real time
- vertex set
- strongly connected
- graphical representation
- graph mining
- directed acyclic graph
- graph matching
- graph representation
- graph theoretic
- edge weights
- minimum spanning tree
- data processing
- xml documents
- pairwise
- data streams