A method and device for obtaining a minimum cut of a directed graph

An acquisition method and directed graph technology, which is applied in the field of network optimization and can solve problems such as low performance and network congestion.

Active Publication Date: 2018-03-13
HUAWEI TECH CO LTD +1
View PDF3 Cites 0 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Problems solved by technology

[0003] The inventor found that the above method has the following problems: During the calculation process of each superstep, a large amount of communication and synchronization between active nodes are required, which leads to network congestion and extremely low performance

Method used

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
View more

Image

Smart Image Click on the blue labels to locate them in the text.
Viewing Examples
Smart Image
  • A method and device for obtaining a minimum cut of a directed graph
  • A method and device for obtaining a minimum cut of a directed graph
  • A method and device for obtaining a minimum cut of a directed graph

Examples

Experimental program
Comparison scheme
Effect test

Embodiment Construction

[0095] The following will clearly and completely describe the technical solutions in the embodiments of the present invention with reference to the accompanying drawings in the embodiments of the present invention. Obviously, the described embodiments are only some, not all, embodiments of the present invention. Based on the embodiments of the present invention, all other embodiments obtained by persons of ordinary skill in the art without making creative efforts belong to the protection scope of the present invention.

[0096] see figure 1 , is a schematic flowchart of a method for obtaining a minimum cut of a directed graph provided in this embodiment, including:

[0097] S101: According to a preset strategy, divide the directed graph into at least two sink subgraphs and at least two source subgraphs;

[0098] Exemplarily, all the sink subgraphs contain the sinks of the directed graph, and all the sink subgraphs have a sequential containment relationship; all the source poi...

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
Login to view more

PUM

No PUM Login to view more

Abstract

The embodiment of the present invention provides a method and device for obtaining the minimum cut of a directed graph. The method and device for obtaining the minimum cut of a directed graph on a node set in the form of a subgraph with a sequential containment relationship reduce the time required for parallel computing. The number of communications and synchronization times between the active nodes of the active node improves the performance, wherein the method includes: dividing the directed graph into at least two subgraphs of sink points and at least two subgraphs of source points respectively according to a preset strategy; parallel computing all The minimum cut set of the sink subgraph and the equivalent sink of the directed graph are obtained through the communication between the sink subgraphs, and the minimum cut set of all the source point subgraphs is calculated in parallel and the directed graph is obtained through the communication between the source point subgraphs The equivalent source point of the directed graph; obtain the minimum cut of the directed graph according to all the edges connected by the equivalent sink point of the directed graph and the equivalent source point of the directed graph.

Description

technical field [0001] The invention relates to the field of network optimization, in particular to a method and equipment for obtaining the minimum cut of a directed graph. Background technique [0002] The maximum flow minimum cut problem is a classic problem in the field of network optimization, which can be widely used in the application background with the network as the form of expression. The methods proposed for this problem are all based on the parallel computing of the nodes in the network. Active nodes are processed in parallel through the overall synchronous parallel computing model (Bulk Synchronous Parallel Computing Model, BSP model), and each active node is calculated through superstep until there are no active nodes in the entire network, and the calculation ends. [0003] The inventors found that the above methods have the following problems: during the calculation process of each superstep, a large amount of communication and synchronization between active...

Claims

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
Login to view more

Application Information

Patent Timeline
no application Login to view more
Patent Type & Authority Patents(China)
IPC IPC(8): G06F9/46
Inventor 王蕾崔慧敏冯晓兵
Owner HUAWEI TECH CO LTD
Who we serve
  • R&D Engineer
  • R&D Manager
  • IP Professional
Why Eureka
  • Industry Leading Data Capabilities
  • Powerful AI technology
  • Patent DNA Extraction
Social media
Try Eureka
PatSnap group products

Browse by: Latest US Patents, China's latest patents, Technical Efficacy Thesaurus, Application Domain, Technology Topic.

© 2024 PatSnap. All rights reserved.Legal|Privacy policy|Modern Slavery Act Transparency Statement|Sitemap