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

Random graph neighboring point and distinguishable edge coloring algorithm

An algorithm and neighboring point technology, applied in the field of graph coloring, can solve the problem of multi-constraint distinguishable coloring and no solution.

Inactive Publication Date: 2017-11-21
LANZHOU JIAOTONG UNIV
View PDF0 Cites 5 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Problems solved by technology

[0006] Existing intelligent optimization algorithms such as genetic algorithm, simulated annealing algorithm, particle swarm algorithm, neural network, etc. are only limited to normal point coloring and edge coloring for solving simple constraints when applied to graph coloring problems. no solution yet

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
  • Random graph neighboring point and distinguishable edge coloring algorithm
  • Random graph neighboring point and distinguishable edge coloring algorithm
  • Random graph neighboring point and distinguishable edge coloring algorithm

Examples

Experimental program
Comparison scheme
Effect test

Embodiment

[0085] A neighbor and distinguishable edge coloring algorithm for random graphs, including a storage medium,

[0086] The storage medium includes a program for defining data structures, procedure steps for constructing an objective function, and a coloring algorithm; firstly, the coloring constraints are determined, and then each sub-objective function and a decision function are abstracted, thereby forming a decision equation and an overall objective function, and finally The algorithm and dyeing results are given; the flow chart of the dyeing method is as follows figure 1 shown.

[0087] The program to define the data structure is:

[0088] ⑴int degree[2][n+1]

[0089] The array degree is a two-dimensional array with two rows (i+1) columns, which are used to save the vertices and numbers of different degrees in the graph G arranged from large to small, where i is the number of all degrees that appear in the graph , degree[1][i] represents the number of i-degree points in ...

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 random graph neighboring point and distinguishable edge coloring algorithm. The random graph neighboring point and distinguishable edge coloring algorithm comprises a storage medium. The storage medium comprises a program of a defined data structure, a target function construction program step and a dyeing algorithm; the algorithm comprises the steps that firstly, dyeing constraint conditions are determined, and then target functions and decision functions are abstracted, so that a determination equation and a total target function are formed, and finally an algorithm and a dyeing result are given; compared with a conventional algorithm, the problem of the dyeing limitation under the single condition is solved, distinguishable dyeing can be achieved under the multi-constraint condition, and the purposes of computer communication, timetable arrangement, task scheduling, storage distribution and other combination optimization are achieved.

Description

technical field [0001] The invention belongs to the technical field of graph coloring, and more specifically relates to an adjacent node and distinguishable edge coloring algorithm of a random graph. Background technique [0002] Graph theory (Graph Theory) is an important research branch in the field of mathematics, which originated from the seven bridges problem of Königsberg in the 18th century. Graph theory takes graphs as the research object, and studies the mathematical theory and methods of graphs composed of several vertices and edges connecting any two vertices. Graphs are usually used to describe a specific relationship between certain things: vertices represent things, and edges represent a specific relationship between two associated things. [0003] Graph theory is a branch of mathematics that has been widely used and developed rapidly in recent years. Modern graph theory, as an important branch in the field of mathematics, has been widely used in many fields,...

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/30
CPCG06F16/9024
Inventor 李敬文赵科王露露魏众德
Owner LANZHOU JIAOTONG 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