{"@context": "https://schema.org", "@type": "BreadcrumbList", "itemListElement": [{"@type": "ListItem", "position": 1, "name": "Home", "item": "https://www.patentleaderboard.com/"}, {"@type": "ListItem", "position": 2, "name": "Fast detection of vertex-connectivity with distance constraint", "item": "https://www.patentleaderboard.com/patent/10831829"}]}
Patent Leaderboard
USPTO Patent Rankings Data through Dec 31, 2025
Home › Fast detection of vertex-connectivity with distance constraint

Fast detection of vertex-connectivity with distance constraint

US Patent 10831829 · Granted Nov 10, 2020

Estimated economic value: $62,188,000 ⓘ

Assignee

Inventors

View full patent text on Google Patents →

More Patents by These Inventors

Estimating graph size and memory consumption of distributed graph for efficient 2025
Method of distributed graph loading for minimal communication and good balance v2025
Method of distributed graph loading for minimal communication and good balance v2025
Efficient, in-memory, relational representation for heterogeneous graphs2025
Efficient, in-memory, relational representation for heterogeneous graphs2025
Efficient, in-memory, relational representation for heterogeneous graphs2025
Distributed multi-hop neighborhood extraction for graph machine-learning via pus2025
Subqueries in distributed asynchronous graph queries2025
Subqueries in distributed asynchronous graph queries2025
In-memory processing of unbounded recursive graph queries in relational database2025
Out-of-core BFS for shortest path graph queries2025
Out-of-core BFS for shortest path graph queries2025