Unlock instant, AI-driven research and patent intelligence for your innovation.

A Distributed Method for Computing the Girth of a Directed Graph

A distributed computing and directed graph technology, applied in computing, image analysis, image data processing, etc., can solve problems such as high time complexity and calculation errors, reduce time complexity, reduce complexity, and avoid message congestion Effect

Active Publication Date: 2020-07-10
HUAZHONG UNIV OF SCI & TECH
View PDF4 Cites 0 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Problems solved by technology

This challenge makes simple use of the breadth-first search algorithm to calculate the girth in a weighted directed graph requires a high time complexity, and reducing the time complexity in this way will introduce calculation errors

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 Distributed Method for Computing the Girth of a Directed Graph
  • A Distributed Method for Computing the Girth of a Directed Graph
  • A Distributed Method for Computing the Girth of a Directed Graph

Examples

Experimental program
Comparison scheme
Effect test

Embodiment Construction

[0051] In order to make the object, technical solution and advantages of the present invention clearer, the present invention will be further described in detail below in conjunction with the accompanying drawings and embodiments. It should be understood that the specific embodiments described here are only used to explain the present invention, not to limit the present invention. In addition, the technical features involved in the various embodiments of the present invention described below can be combined with each other as long as they do not constitute a conflict with each other.

[0052]The overall idea of ​​the present invention is to set the lower bound α and upper bound β for the girth g by executing the Bounded BFS algorithm with the distance limit t as a parameter; then set appropriate values ​​for α and β through the execution result of Bounded BFS, and then update t value and re-run the Bounded BFS algorithm, and finally update α and β step by step until the exact ...

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 invention discloses a method for computing the girth of a directed graph in a distributed mode, and belongs to the technical field of parallel and distributed computing. The method disclosed by the invention comprises the steps of firstly transforming all sides with the weight being negative in a directed graph G into sides with the weight being non-negative; then executing a Bounded BFS algorithm with a distance limit parameter t by each point in the graph G; updating a lower bound [alpha] or an upper bound [beta] of the girth g of the directed graph according a termination condition of the Bounded BFS algorithm; then deleting paths with the sum of weights being greater than the lower bound [alpha] or the upper bound [beta] in the graph G according to the upper bound [beta], the lower bound [alpha] and the termination condition of the Bounded BFS algorithm; and finally updating the distance limit parameter t according to the lower bound [alpha] or the upper bound [beta], repeating the steps S2-S5 until the difference between the upper bound [beta] and the lower bound [alpha] is less than or equal to 1, and obtaining the girth g, which is equal to the upper bound [beta], of the graph G. The method disclosed by the invention aims to design a method for computing the girth of a directed graph in a linear time and distributed mode. The time complexity of the method is O(nlognlogg), message congestion can be avoided under the weighted graph, the time complexity of the algorithm is effectively reduced, and the girth of a large-scale directed graph is ensured to be quickly computed in a distributed manner.

Description

technical field [0001] The invention belongs to the technical field of parallel and distributed computing, and more specifically relates to a method for distributed computing the girth of a directed graph. Background technique [0002] A directed graph G is a simple graph consisting of a set V of nodes and a set E of directed edges with weights. Directed graphs can describe the relationship between entities in the real world, such as the relationship between people in social networks; The optimal route; the assignment of work, the arrangement of the project schedule or the formulation of the curriculum can all be modeled using directed graphs. Therefore, the design of directed graph algorithms is an important topic in computer science. [0003] The girth of a directed graph represents the size of the smallest cycle in the directed graph. It is a fundamental problem in graph algorithms and is widely used in social network analysis, data visualization, bioinformatics, and 3...

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): G06T7/62
CPCG06T7/62
Inventor 华强胜金海钱立祥
Owner HUAZHONG UNIV OF SCI & TECH