Efficient graph optimization
Abstract:
A method includes generating, using a processor, a graph including a plurality of nodes and a plurality of paths between the nodes, the graph representing a system comprising an arrangement of elements, and a data structure in which, for each node pair of the plurality of nodes, a count of the number of paths of length S between the node pair is stored in association with the length S. The method includes modifying the graph, using the processor, to obtain a modification of the graph related to the count of the number of paths of length S, and estimating, based on the data structure and the modification, an objective function that is quantitatively representative of the connections between the nodes and being indicative of performance of the system.
Public/Granted literature
Information query
Patent Agency Ranking
0/0