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

Method for improving time efficiency and implementing minimum dominating set through membrane computing

A membrane computing, effective technology, applied in computing, design optimization/simulation, special data processing applications, etc., can solve the problem of difficult to achieve the number of nodes

Inactive Publication Date: 2018-02-23
ANHUI UNIV OF SCI & TECH
View PDF0 Cites 2 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Problems solved by technology

However, using the above method, its calculation time complexity is exponential, and it is difficult to achieve when the number of nodes is large.
There is currently no efficient algorithm for finding the minimum dominating set in specific linear time

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
  • Method for improving time efficiency and implementing minimum dominating set through membrane computing
  • Method for improving time efficiency and implementing minimum dominating set through membrane computing

Examples

Experimental program
Comparison scheme
Effect test

Embodiment Construction

[0052] The principles and methods of the present invention are described in conjunction with the following, and the examples are only used to explain the present invention and are not intended to limit the scope of the present invention;

[0053] Combining with the content of the above invention, it is assumed that the undirected graph to be built is a 4×4 matrix (m=4, n=3), and a=1, b=2, c=0. Specifically, it is divided into two stages to complete.

[0054] Phase 1: split the cell marked 2 into 2 cells, and iterate until the possible candidate solution is terminated. At the same time, the 4 counters respectively determine the start time and set the counting unit to 1, and the rules are in their respective membranes. execute in parallel. Specifically include the following steps:

[0055] Step 1: Initialize the counter and object set as follows:

[0056] [[ZX 1 x 2 x 12 x 3 x 23 count1 0 count2 0 count3 0 countD 0 ] 2 count4 0 ] 1

[0057] Step 2: Use the rule to...

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 a method for improving the time efficiency and implementing a minimum dominating set through membrane computing. The method comprises the following steps that a membrane computing (in a P system) minimum dominating set (MDS) model is constructed; membrane computing units used for implementing the MDS are initialized; the number of the membrane computing units is defined; alinear expression is input the membrane computing units; combined with an algorithm, iterative execution is conducted in a P-Lingua environment, and finally the MDS based on the membrane computing isimplemented in linear time. By means of the method, the minimum dominating set is implemented through the membrane computing, and through the results of the embodiment, it is shown that the method improves the time efficiency and solves that problem of the effective algorithm for solving the minimum dominating set in the linear time.

Description

Technical field: [0001] The invention belongs to the optimization research field of membrane calculation, and is designed to the dominating set problem in graph theory, more specifically, it is a method for using membrane calculation to improve time efficiency and realize minimum matching set. Background technique: [0002] As one of the main problems of graph theory algorithms, the minimum matching set (MDS) has a large number of applications, especially in graph mining. Since it is an NP-hard approximate solution to MDS, many works have been devoted to restricting the center of the graph class. and distributed approximation algorithms. In terms of algorithm realization of the minimum dominating set of the graph, using tabu search, genetic algorithm, etc., the minimum dominating set can always be found in the end, and comparing the results, the minimum dominating set is the minimum cardinality. But using the above method, its calculation time complexity is exponential, and...

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 Applications(China)
IPC IPC(8): G06F17/50
CPCG06F30/20
Inventor 许家昌黄友锐
Owner ANHUI UNIV OF SCI & TECH
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