MLkP/CR algorithm-based undirected graph dividing method
An undirected graph and algorithm technology, applied in the direction of digital transmission system, electrical components, transmission system, etc., can solve the problem of not being able to guarantee the self-connectivity of the graph, and achieve the effect of observing the network topology map, uniform distribution, and reducing the total number
- Summary
- Abstract
- Description
- Claims
- Application Information
AI Technical Summary
Problems solved by technology
Method used
Image
Examples
Embodiment Construction
[0017] The undirected graph segmentation method based on the MLkP / CR algorithm described in this embodiment is divided into the following three stages:
[0018] Coarsening Phase: undirected graph G to be split 0 (V 0 ,E 0 ) to reduce the undirected graph G 0 (V 0 ,E 0 ) in a number of points into one point, reduced to an undirected graph G n (V n ,E n ), reduce the scale of the topology map, where V 0 is an undirected graph G 0 The set of vertices in E 0 is an undirected graph G 0 The set of middle edges, V n is an undirected graph G n The set of vertices in E n is an undirected graph G n set of middle edges;
[0019] Initial Partitioning Phase: the undirected graph G obtained in the specification phase n (V n ,E n ) to perform k divisions to obtain k subgraphs G i (V i ,E i ), each subgraph G obtained by dividing i (V i ,E i ) are self-connected, each subgraph G i (V i ,E i ) The number of points in ) is basically equal, and the number of cut edges ...
PUM
Abstract
Description
Claims
Application Information
- R&D Engineer
- R&D Manager
- IP Professional
- Industry Leading Data Capabilities
- Powerful AI technology
- Patent DNA Extraction
Browse by: Latest US Patents, China's latest patents, Technical Efficacy Thesaurus, Application Domain, Technology Topic, Popular Technical Reports.
© 2024 PatSnap. All rights reserved.Legal|Privacy policy|Modern Slavery Act Transparency Statement|Sitemap|About US| Contact US: help@patsnap.com