Looking for breakthrough ideas for innovation challenges? Try Patsnap Eureka!

Longest circle rapid detection method and system based on ant colony algorithm, and storage medium

An ant colony algorithm and detection method technology, applied in the field of complex network analysis, can solve problems such as lack of universality and difficulty in approximate detection methods, and achieve the effect of avoiding premature convergence and accelerating convergence.

Pending Publication Date: 2022-04-08
CHONGQING UNIV
View PDF0 Cites 0 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Problems solved by technology

[0006] Approximate detection methods, previous LCP approximation methods focus on the theoretical properties of regular graphs, which find the approximate longest cycle (longest path) by combining specific substructures of the graph, for example: combining dynamic programming and depth-first search gives k - LCP approximation method with linear time complexity in the tree graph; although the approximate detection method reduces the time overhead to a certain extent, it is difficult to directly apply the approximate detection method to the longest cycle solution of the irregular network, so it does not have general suitability

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
  • Longest circle rapid detection method and system based on ant colony algorithm, and storage medium
  • Longest circle rapid detection method and system based on ant colony algorithm, and storage medium
  • Longest circle rapid detection method and system based on ant colony algorithm, and storage medium

Examples

Experimental program
Comparison scheme
Effect test

Embodiment 1

[0091] This embodiment is basically as attached figure 1 Shown: The longest circle fast detection method based on ant colony algorithm, including the following content:

[0092] Preprocessing step: preprocessing the undirected graph G, segmenting the preprocessed G, and obtaining a connected component set CC={G 1 ,G 2 ,...,G k};Specifically:

[0093] S101, circularly delete the leaf nodes in G; where the leaf nodes refer to the vertices with a degree of 1 in G, that is, the vertices with only one edge; therefore, the leaf nodes must not exist in the longest circle, so the leaf nodes are prune;

[0094] S102. Query the cut points in G, and divide G after pruning the leaf nodes according to the cut points, and divide G into CC={G 1 ,G 2 ,...,G k}. In this embodiment, the query is performed by using the existing query cut point method. The cut point of the graph is the vertex that divides the graph into two or more connected components, so any circle of the graph can only...

Embodiment 2

[0138] This embodiment is basically the same as the above-mentioned embodiment, the difference is that it also includes a collection step: collecting node information and relationship information between nodes; generating G according to the node information and relationship information, and performing a preprocessing step on G and cycle detection steps, as long as the problem in any field can be converted into longest cycle detection, and its information can be converted into corresponding node information and relationship information, this method can be used to quickly detect the longest cycle, making the application of this detection method The scope is wider, for example: the relationship identification between platform users, the user is the node information, and the attention information between users is the relationship information, then the user relationship network diagram is generated, and the longest circle detection can be performed on the user relationship network di...

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 relates to the technical field of complex network analysis, in particular to a longest circle rapid detection method and system based on an ant colony algorithm and a storage medium, and the method comprises the steps: carrying out the preprocessing of an undirected graph and a graph reduction strategy to reduce the scale of the graph, and improving the search efficiency through employing a PD-LS search strategy combined with the ant colony algorithm; wherein the undirected graph is segmented into a plurality of connected components after preprocessing, so that a connected component set is obtained; the graph reduction strategy comprises a short edge deletion strategy and a connected component deletion strategy; in combination with a PD-LS search strategy of an ant colony algorithm, a longer circle can be obtained by local disturbance each time within finite time by changing an end condition of a depth-first algorithm, and when the ant colony algorithm is used for searching, a population is guided to develop in a better direction by continuously strengthening pheromones of edges in the circle searched by the ant colony before. According to the scheme, the time overhead is reduced, the method does not depend on the characteristics of the graph, the universality is higher, and the longest circle can be quickly and accurately found.

Description

technical field [0001] The invention relates to the technical field of complex network analysis, in particular to a method, system and storage medium for fast longest circle detection based on an ant colony algorithm. Background technique [0002] The longest cycle is the longest cycle in a simple undirected graph, and each vertex is traversed at most once. As one of the classic NP-hard problems in graph theory, the longest cycle problem (Longest Cycle Problem, LCP) of finding the longest cycle has attracted much attention. [0003] The longest circle problem is of great significance in the field of complex network analysis. It is closely related to the community structure, hierarchical structure and communication process in real networks. It is widely used in statistical mechanics, computer graphics, biological information, structural chemistry, network dynamics There are also close links in other fields. Therefore, the longest circle problem is widely used in the above f...

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
IPC IPC(8): G06T7/62G06T7/11G06T7/187G06N3/00
Inventor 江依澄郭平
Owner CHONGQING UNIV
Who we serve
  • R&D Engineer
  • R&D Manager
  • IP Professional
Why Patsnap Eureka
  • Industry Leading Data Capabilities
  • Powerful AI technology
  • Patent DNA Extraction
Social media
Patsnap Eureka Blog
Learn More
PatSnap group products

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