Patents by Inventor Ning Ruan

Ning Ruan has filed for patents to protect the following inventions. This listing includes patent applications that are pending as well as patents that have already been granted by the United States Patent and Trademark Office (USPTO).

  • Shortest path computation in large networks
    Patent number: 10521473
    Abstract: Embodiments disclosed herein provide systems, methods, and software for determining the shortest distance between vertices in relatively large graphs. In an embodiment a method includes identifying an original graph comprising a plurality of nodes and a plurality of edges, identifying a plurality of hub nodes from within the original graph, creating a hub matrix comprising the plurality of hub nodes and the shortest distance between the plurality of hub nodes, and determining a shortest distance between the at least two nodes using the original graph and/or the hub matrix.
    Type: Grant
    Filed: May 21, 2013
    Date of Patent: December 31, 2019
    Assignee: KENT STATE UNIVERSITY
    Inventors: Ruoming Jin, Ning Ruan
  • SYSTEMS, METHODS AND SOFTWARE FOR COMPUTING REACHABILITY IN LARGE GRAPHS
    Publication number: 20150019592
    Abstract: Embodiments disclosed herein provide systems and methods for scaling reachability computations on relatively large graphs. In an embodiment, a method provides for scaling reachability computations on relatively large graphs, the method comprising, identifying an initial graph comprising a plurality of vertices and a plurality of edges, processing at least a portion of the plurality of vertices and at least a portion of the plurality of edges to generate a plurality of reachability indices for the at least a portion of the plurality of vertices, and generating a backbone graph comprising a scaled-down version of the initial graph, based at least in part on at least one of the plurality of reachability indices.
    Type: Application
    Filed: March 13, 2013
    Publication date: January 15, 2015
    Inventors: Ruoming Jin, Ning Ruan
  • SHORTEST PATH COMPUTATION IN LARGE NETWORKS
    Publication number: 20130339352
    Abstract: Embodiments disclosed herein provide systems, methods, and software for determining the shortest distance between vertices in relatively large graphs. In an embodiment a method includes identifying an original graph comprising a plurality of nodes and a plurality of edges, identifying a plurality of hub nodes from within the original graph, creating a hub matrix comprising the plurality of hub nodes and the shortest distance between the plurality of hub nodes, and determining a shortest distance between the at least two nodes using the original graph and/or the hub matrix.
    Type: Application
    Filed: May 21, 2013
    Publication date: December 19, 2013
    Inventors: Ruoming Jin, Ning Ruan