Partition calculation method for reachable matrix of undirected graph

By partitioning large network graphs and independently computing the reachable matrix of subgraphs, combined with the boundary equivalent data update mechanism, the problem of insufficient computing speed of large network graphs is solved, and the ability to efficient topological analysis and fast response is achieved.

CN119670856APending Publication Date: 2025-03-21TRAINING CENT OF ANHUI ELECTRIC POWER +2
0 Cites 1 Cited by

Patent Information

Application Number
CN202411722095.8
Authority / Receiving Office
CN · China
Patent Type
Applications(China)
Current Assignee / Owner
Filing Date
2024-11-28
Publication Date
2025-03-21

AI Technical Summary

Technical Problem

When the prior art processes large network graphs with a number of vertices exceeding 3,000, the calculation speed is insufficient, making it difficult to meet the needs of efficient topological analysis.

Method used

The undirected graph is divided into multiple subgraphs through partitioning algorithms, and the reachable matrix of each subgraph is independently calculated to reduce the complexity and resource requirements of global computing. At the same time, a boundary equivalent data update mechanism is introduced to achieve rapid adjustment of local matrices and avoid global recalculation.

Benefits of technology

It significantly improves the computing efficiency of large-scale network topology analysis, reduces the computing resource requirements, and improves the system's response speed in dynamic environments. It is especially suitable for areas such as power grid operation analysis and dynamic traffic scheduling.

✦ Generated by Eureka AI based on patent content.
Patent Text Reader

Abstract

The invention discloses a partition calculation method of an undirected graph reachable matrix, and relates to the technical field of data mining. According to the method, the undirected graph is divided into a plurality of sub-graphs through a partitioning algorithm, and the reachable matrix of each sub-graph is independently calculated, so that the complexity and resource requirements of global calculation are reduced, and the calculation efficiency is improved. In addition, a multi-core and distributed computing environment is utilized, so that network topology analysis scenes, such as power grid operation analysis, dynamic traffic scheduling and the like, with high requirements on real-time performance of a large-scale network can be efficiently processed. For network dynamic changes, a boundary equivalent data updating mechanism is introduced, rapid adjustment of a local matrix is achieved, global recalculation is not needed, the response speed of the system in a frequent topology change scene is remarkably improved, and the method is suitable for the business fields of power grid operation analysis, dynamic traffic scheduling and the like. And efficient operation and real-time response capability of the system are effectively guaranteed.
Need to check novelty before this filing date? Find Prior Art