Back to results
US 2013/0297631 A1Published application
System, method, and computer program product for performing graph aggregation
AssigneeNVIDIA Corporation
InventorsPatrice Castonguay, Jonathan Michael Cohen
Life of this patent
Estimating the term…
Abstract
A system, method, and computer program product are provided for performing graph aggregation. In use, a graph with a plurality of vertices and a plurality of edges is identified. Additionally, aggregation is performed on the vertices and edges of the graph by computing a graph matching, where such graph matching is performed in a data-parallel manner.
Claims24
A method, comprising:
- identifying a graph with a plurality of vertices and a plurality of edges;
- and
- performing aggregation on the vertices and the edges of the graph to return a new graph by:
- performing graph matching on the vertices and the edges of the graph including determining a set of edges within the graph that do not share a common vertex, and
- for each of the edges in the set, collapsing the edge into a single new vertex of the new graph, where such collapsing of the edges in the set is performed in a data-parallel manner.
2 more elements
(canceled)
(canceled)
(canceled)
(canceled)
(canceled)
A computer program product embodied on a non-transitory computer readable medium, comprising:
- code for identifying a graph with a plurality of vertices and a plurality of edges;
- and
- code for performing aggregation on the vertices and the edges of the graph to return a new graph by:
- performing graph matching on the vertices and the edges of the graph including determining a set of edges within the graph that do not share a common vertex, and
- for each of the edges in the set, collapsing the edge into a single new vertex of the new graph, where such collapsing of the edges in the set is performed in a data-parallel manner.
2 more elements
A system, comprising:
- a parallel processor for:
- identifying a graph with a plurality of vertices and a plurality of edges, and
- performing aggregation on the vertices and the edges of the graph to return a new graph by:
- performing graph matching on the vertices and the edges of the graph including determining a set of edges within the graph that do not share a common vertex, and
- for each of the edges in the set, collapsing the edge into a single new vertex of the new graph, where such collapsing of the edges in the set is performed in a data-parallel manner.
2 more elements
Dependencies are inferred from the claim text.