Patent Leaderboard
USPTO Patent Rankings Data through Dec 31, 2025
Home › Shortest and cheapest paths in distributed asynchronous graph traversals

Shortest and cheapest paths in distributed asynchronous graph traversals

US Patent 12505101 · Granted Dec 23, 2025

Assignee

Inventors

View full patent text on Google Patents →

More Patents by These Inventors

RFID tag for a tamper proof attachment to an object such as a licence plate2025
Display device with low reflective components2025
Semiconductor device and method of manufacturing the same2025
Estimating graph size and memory consumption of distributed graph for efficient 2025
Estimating graph size and memory consumption of distributed graph for efficient 2025
Estimating graph size and memory consumption of distributed graph for efficient 2025
Compilation techniques for algorithmic graph processing in a relational database2025
Distributed multi-hop neighborhood extraction for graph machine-learning via pus2025
Distributed multi-hop neighborhood extraction for graph machine-learning via pus2025
Distributed multi-hop neighborhood extraction for graph machine-learning via pus2025
Subqueries in distributed asynchronous graph queries2025
In-memory processing of unbounded recursive graph queries in relational database2025