Efficient representations of graphs with multiple edge types
Number of patents in Portfolio can not be more than 2000
United States of America Patent
Stats
-
Mar 20, 2018
Issued Date -
N/A
app pub date -
Apr 28, 2014
filing date -
Apr 28, 2014
priority date (Note) -
In Force
status (Latency Note)
Importance
|
US Family Size
|
Non-US Coverage
|
|
Patent Longevity
|
Forward Citations
|
Abstract
One embodiment of the present invention provides a computing system. The computing system includes a processor and a computer-readable storage medium. The computer-readable storage medium stores instructions which when executed by the processor cause the processor to perform a method. The method comprises obtaining from a first data structure one or more pointers to corresponding elements in a second data structure. A respective vertex of a graph corresponds to an element in the first data structure and the graph supports multiple edge types between respective vertex pairs. The method further comprises obtaining from the second data structure a respective edge type associated with a respective vertex and a respective successor vertex of the edge type and enumerating a respective successor vertex of an edge type of a vertex from the second data structure based on a pointer in an element in the first data structure associated with the vertex.
First Claim
Other Claims data not available
Family
- No Family data available.
International Classification(s)
Cited Art Landscape
Patent Citation Ranking
- 0 Citation Count
- G06T Class
- 0 % this patent is cited more than
- 7 Age
Maintenance Fees
| Fee | Large entity fee | small entity fee | micro entity fee | due date |
|---|---|---|---|---|
| 7.5 Year Payment | $3600.00 | $1800.00 | $900.00 | Sep 20, 2025 |
| 11.5 Year Payment | $7400.00 | $3700.00 | $1850.00 | Sep 20, 2029 |
