SYSTEMS AND METHODS FOR DISTANCE APPROXIMATION IN GRAPHS
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 gra...
Saved in:
Main Authors | , , , |
---|---|
Format | Patent |
Language | English French German |
Published |
10.08.2016
|
Subjects | |
Online Access | Get full text |
Cover
Loading…
Summary: | 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. |
---|---|
Bibliography: | Application Number: EP20140824521 |