Systems And Methods For Distance Approximation In Graphs
AssigneeAlcatel Lucent
InventorsDeepak Ajwani, William S. Kennedy, Alessandra Sala, Iraj Saniee
Life of this patent
Estimating the term…
Loading patent…
AssigneeAlcatel Lucent
InventorsDeepak Ajwani, William S. Kennedy, Alessandra Sala, Iraj Saniee
Estimating the term…
Systems and methods are provided for constructing a collection of one or more tree sub-graph representations of a graph including multiple interconnected nodes, where the one or more tree sub-graph representations of the graph are used to estimate the shortest distance between any two nodes of a graph. One of the features of the systems and methods disclosed herein is a methodology for the selection or designation of root nodes for constructing the collection of the one or more tree sub-graph representations. Another feature of the present disclosure is a methodology of expanding the parent nodes in a given level of the tree sub-graph representations into one or more child nodes in a successive level of the tree-graph representations based on a descending order of degree of the parent nodes.
A computer-implemented method for constructing one or more tree sub-graphs for estimating a shortest distance between a given pair of nodes of a graph having multiple interconnected nodes, the method comprising:
An apparatus configured to construct one or more tree sub-graphs data structures for estimating a shortest distance between a given pair of nodes of a graph having multiple interconnected nodes, the method comprising:
Dependencies are inferred from the claim text.