CN108876874A - Figure vertex coloring method, processing equipment and storage medium - Google Patents
Figure vertex coloring method, processing equipment and storage medium Download PDFInfo
- Publication number
- CN108876874A CN108876874A CN201810597255.9A CN201810597255A CN108876874A CN 108876874 A CN108876874 A CN 108876874A CN 201810597255 A CN201810597255 A CN 201810597255A CN 108876874 A CN108876874 A CN 108876874A
- Authority
- CN
- China
- Prior art keywords
- vertex
- uncoloured
- different
- coloring
- color
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Pending
Links
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06T—IMAGE DATA PROCESSING OR GENERATION, IN GENERAL
- G06T11/00—2D [Two Dimensional] image generation
- G06T11/60—Editing figures and text; Combining figures or text
Landscapes
- Physics & Mathematics (AREA)
- General Physics & Mathematics (AREA)
- Engineering & Computer Science (AREA)
- Theoretical Computer Science (AREA)
- Processing Or Creating Images (AREA)
Abstract
The embodiment of the invention discloses a kind of figure vertex coloring method, processing equipment and storage medium, the time-consuming coloured for reducing the vertex to figure.The figure vertex coloring method of the embodiment of the present invention is applied to processing equipment, and the processing equipment includes at least two threads, and this method includes：Obtain the figure including multiple uncoloured vertex；It is at least two vertex sets by multiple uncoloured vertex partitions；The uncoloured vertex in different vertex sets is coloured using different threads parallel, obtains colored vertex；When the first vertex is identical with the second vertex color, it will be determined as uncoloured vertex one of in first vertex and the second vertex, and the step of colouring parallel using different threads to the uncoloured vertex in different vertex sets is executed, so that the first vertex and the second vertex color difference.In this way, reduce the time-consuming that opposite vertexes are coloured, and after ensure that the vertex coloring to figure, color is different between adjacent vertex.
Description
Technical field
The present invention relates to diagram data process fields more particularly to a kind of figure vertex coloring method, processing equipment and storage to be situated between
Matter.
Background technique
As an important branch of computer science, scheme (Graph, G) be frame in Data Structure and Algorithm it
One.Figure can be used to show almost all kinds of structure or system, for example, transportation network, communication network, circuit board wiring,
Path planning is played chess, game, optimal process, task distribution and the interpersonal Internet etc..In academic or engineering practice field,
Figure is all generally considered as a kind of abstract network being made of " vertex " (Vertex), each vertex in network can pass through " side "
(Edge) it realizes mutual connection, indicates that two vertex are relevant.Therefore, figure can generally be abbreviated as G (V, E).
In many applications of figure, map colouring problem (Graph Coloring Problem, GCP) has greatly practical
Value.As famous one of NP-complete problem, map colouring problem is segmented into two parts：
1) M- of figure colours decision problem, i.e., the different color of given Connected undigraph G and M kind, is figure G with these colors
Each vertex coloring, wherein each vertex a kind of color.Determining whether there is a kind of colouring makes two of arbitrary neighborhood in G
Vertex different colors.
2) M- of figure colours optimization problem, and even one figure at least needs M kind color that can just make two of arbitrary neighborhood in figure
A vertex different colors, then this number M is referred to as the chromatic number of the figure, the problem of seeking the minimum chromatic number M an of figure referred to as M-
Color optimization problem.Wherein, the superiority and inferiority for measuring M- coloring optimization problem solution mainly sees two indices：Chromatic number M it is small, time-consuming
It is short.
The M- coloring optimization problem seen at present is to belong to the realization of serial mode, this is not advised in processing Large Graph or seriously
It can be taken a long time when then scheming, treatment effeciency is low, and needs chromatic number M to be used also larger.
Summary of the invention
In view of the above technical problems, the embodiment of the invention provides a kind of figure vertex coloring method, processing equipment and storages
Medium, the time-consuming coloured for reducing the vertex to figure.
The first aspect of the embodiment of the present invention provides a kind of figure vertex coloring method, and the method is applied to processing equipment,
The processing equipment includes at least two threads, the method includes：
Obtain the figure including multiple uncoloured vertex；
It is at least two vertex sets by the multiple uncoloured vertex partition；
The uncoloured vertex in different vertex sets is coloured using different threads parallel, obtains colored top
Point；
Judge whether the first vertex is identical with the second vertex color, wherein first vertex is the colored top
Any vertex in point, second vertex are any vertex adjacent with first vertex in the colored vertex,
First vertex and second vertex are the vertex coloured respectively by different threads；
It, will be in first vertex and second vertex if first vertex is identical with second vertex color
One of be determined as uncoloured vertex, and execute it is described it is parallel using different threads in different vertex sets not
The step of vertex of color is coloured, so that first vertex is different with second vertex color.
Optionally, it is described by the multiple uncoloured vertex partition be at least two vertex sets before, the method is also
Including：
Determine that the quantity TN, the TN of subject thread are the positive integer more than or equal to 2, the subject thread is for simultaneously
The thread of row coloring；
It is described by the multiple uncoloured vertex partition be at least two vertex sets, including：
It is TN vertex set by the multiple uncoloured vertex partition；
It is described it is parallel the uncoloured vertex in different vertex sets is coloured using different threads, obtain colored
Vertex, including：
Assign the TN vertex set to different subject threads respectively；
The uncoloured vertex in vertex set being imparted to parallel using each subject thread to each subject thread is carried out
Coloring, obtains colored vertex.
Optionally, it is described by the multiple uncoloured vertex partition be TN vertex set, including：
The quantity VN, the VN that the multiple uncoloured vertex is calculated are the positive integer more than or equal to 2；
Determine processing number of vertex VPT, wherein described Expression rounds up, the VPT
For positive integer；
It is TN vertex set by VN uncoloured vertex partitions, so that at least TN-1 vertex set packet according to the VPT
The uncoloured vertex quantity included is VPT.
Optionally, described according to the VPT, it is TN vertex set by VN uncoloured vertex partitions, so that at least TN-
The uncoloured vertex quantity that 1 vertex set includes is VPT, including：
Serial number is carried out to VN uncoloured vertex using 1 to VN；
Since the uncoloured vertex that number is 1, numbering continuous uncoloured vertex partition for every VPT is one
Vertex set, to obtain TN vertex set, and the uncoloured vertex quantity that at least TN-1 vertex set includes is VPT.
Optionally, described to be determined as uncoloured top one of in first vertex and second vertex
Point, including：
The big vertex of number in first vertex and second vertex is determined as uncoloured vertex.
Optionally, the quantity TN of the determining subject thread, including：
Central processor CPU the nucleus number PN, the PN for obtaining the processing equipment are positive integer；
Determine the quantity TN=PN-1 of subject thread.
Optionally, it is described it is parallel the uncoloured vertex in different vertex sets is coloured using different threads, obtain
Colored vertex, including：
The uncoloured vertex in different vertex sets is coloured using different threads parallel, so that in different vertex sets
Adjacent colored vertex color including colored vertex, and in each vertex set is different.
The second aspect of the embodiment of the present invention provides a kind of processing equipment, and the processing equipment includes at least two threads,
The processing equipment includes：
Acquiring unit, for obtaining the figure including multiple uncoloured vertex；
Division unit, for being at least two vertex sets by the multiple uncoloured vertex partition；
Coloring units are obtained for being coloured parallel using different threads to the uncoloured vertex in different vertex sets
To colored vertex；
Judging unit, for judging whether the first vertex is identical with the second vertex color, wherein first vertex is institute
Any vertex in colored vertex is stated, second vertex is adjacent with first vertex in the colored vertex
Any vertex, first vertex and second vertex are the vertex coloured respectively by different threads；
Determination unit, if for first vertex it is identical with second vertex color, will first vertex with
It is determined as uncoloured vertex one of in second vertex；
The coloring units, be also used to execute it is described it is parallel using different threads to the uncoloured top in different vertex sets
The step of point is coloured, so that first vertex is different with second vertex color.
Optionally, the processing equipment further includes quantity determination unit；
The quantity determination unit, for determining that the quantity TN, the TN of subject thread are just whole more than or equal to 2
Number, the subject thread are the thread for colouring parallel；
The division unit is also used to the multiple uncoloured vertex partition be TN vertex set；
The coloring units include assigning module and staining module；
The imparting module, for assigning the TN vertex set to different subject threads respectively；
The staining module, in the vertex set for being imparted to parallel using each subject thread to each subject thread
Uncoloured vertex is coloured, and colored vertex is obtained.
The third aspect of the embodiment of the present invention provides a kind of storage medium, is stored with processor-executable instruction, institute
It states instruction to be loaded by one or more processors, to execute such as figure vertex coloring method any in claim 1-7.
In technical solution provided in an embodiment of the present invention, in the processing equipment for including at least two threads, acquisition includes
Then multiple uncoloured vertex partitions are at least two vertex sets by the figure on multiple uncoloured vertex.It is parallel to use difference
Thread colours the uncoloured vertex in different vertex sets, obtains colored vertex.And then, judging the first vertex is
It is no identical with the second vertex color, wherein the first vertex is any vertex in colored vertex, and the second vertex is colored
Vertex in any vertex adjacent with the first vertex, the first vertex and the second vertex are to be coloured respectively by different threads
Vertex.If the first vertex is identical with the second vertex color, will be determined as one of in the first vertex and the second vertex
Uncoloured vertex, and execute the step coloured parallel using different threads to the uncoloured vertex in different vertex sets
Suddenly, so that the first vertex and the second vertex color difference.In this way, uncoloured vertex is grouped, at least two tops are obtained
After point set, coloring treatment is carried out to different vertex set using different threads parallel, realize the colouring tasks of opposite vertexes into
Row divides, by multi-threading parallel process, so that the time-consuming that opposite vertexes are coloured is reduced, in addition, working as the first adjacent vertex
When identical with the second vertex color, return and execute parallel using different threads to the uncoloured vertex progress in different vertex sets
The step of coloring, so that the first vertex and the second vertex color difference, after ensure that the vertex coloring to figure, between adjacent vertex
Color is different.
Detailed description of the invention
Fig. 1 is a kind of flow chart for figure vertex coloring method that one embodiment of the invention provides；
Fig. 2 be another embodiment of the present invention provides a kind of figure vertex coloring method flow chart；
Fig. 3 be another embodiment of the present invention provides a kind of embodiment of the present invention figure vertex coloring method and existing string
Rowization color rendering intent time-consuming comparison diagram；
Fig. 4 be another embodiment of the present invention provides a kind of embodiment of the present invention figure vertex coloring method and existing string
The minimum chromatic number comparison diagram that rowization color rendering intent needs；
Fig. 5 be another embodiment of the present invention provides a kind of processing equipment structural schematic diagram.
Specific embodiment
Following will be combined with the drawings in the embodiments of the present invention, and technical solution in the embodiment of the present invention carries out clear, complete
Site preparation description, it is clear that described embodiments are only a part of the embodiments of the present invention, instead of all the embodiments.It is based on
Embodiment in the present invention, those skilled in the art's every other implementation obtained without creative efforts
Example, shall fall within the protection scope of the present invention.
In order to be more clearly understood to various embodiments of the present invention, first various embodiments of the present invention are related to below some arts
Language is introduced.
1, scheme
Figure (Graph, G) is one of the frame in Data Structure and Algorithm.Figure can be used to show nearly all type
Structure or system, for example, transportation network, communication network, circuit board wiring, path planning, play chess, game, optimal process, appoint
Business distribution and the interpersonal Internet etc..
In academic or engineering practice field, figure is all generally considered as a kind of abstract net being made of " vertex " (Vertex)
Network, each vertex in network can realize mutual connection by " side " (Edge), indicate that two vertex are relevant.Therefore, scheme
G (V, E) can be generally abbreviated as.
Fig. 1 is a kind of flow chart of figure vertex coloring method provided in an embodiment of the present invention.The figure top of the embodiment of the present invention
Lighting color method can be applied in processing equipment, wherein the processing equipment includes at least two threads.
Refering to fig. 1, the figure vertex coloring method of the embodiment of the present invention includes：
Step 101：Obtain the figure including multiple uncoloured vertex.
Processing equipment obtains figure to be processed, which includes multiple uncoloured vertex, these vertex are top to be colored
Point.
Such as the specific descriptions of term part above, the figure of the embodiment of the present invention is the abstract network being made of vertex.?
On figure, adjacent vertex can have side connection.
It is appreciated that the processing equipment of the embodiment of the present invention includes but is not limited to tablet computer, notebook, personal computer
Equal electronic equipments.
Step 102：It is at least two vertex sets by multiple uncoloured vertex partitions.
After processing equipment gets the figure including multiple uncoloured vertex, can be by multiple uncoloured vertex partition
At least two vertex sets.Each vertex set all includes different uncoloured vertex, in other words, to multiple uncoloured vertex
It is grouped.
It is appreciated that processing equipment divides multiple uncoloured vertex, the quantity of obtained vertex set is at least
Two, for example, 2,3,4 or 5 etc., the present invention is not especially limit this.
In addition, the quantity on the uncoloured vertex that each vertex set includes can be one or more, the embodiment of the present invention
This is not especially limited.
Step 103：Parallel the uncoloured vertex in different vertex sets is coloured using different threads, is obtained
The vertex of color.
Processing equipment parallel colours the uncoloured vertex in different vertex sets using different threads, obtains
The vertex of color.In other words, different vertex sets are assigned different threads by processing equipment, each thread are then used parallel, to each
Uncoloured vertex in the vertex set that a thread is imparted to is coloured, to be colored by uncoloured vertex coloring
Vertex.
In embodiments of the present invention, the coloring treatment that the uncoloured vertex of different threads opposite vertexes collection carries out, is parallel
It executes namely processing equipment uses the uncoloured vertex of different threads opposite vertexes collection to carry out coloring treatment simultaneously.It is such simultaneously
Row color rendering intent can endure the efficiency of high coloring, reduce the time-consuming of coloring.
Wherein, processing equipment can execute step 103 using all threads in processing equipment parallel, and portion also can be used
Separated time journey executes step 103, only need to use at least two threads to be parallel.
In some embodiments of the invention, step 103 can be for parallel using different threads in different vertex sets
Uncoloured vertex is coloured, so as to include colored vertex in different vertex sets, and adjacent in each vertex set
Colored vertex color is different.In other words, processing equipment is parallel using different threads to uncolored in different vertex sets
Vertex when being coloured, guarantee that adjacent vertex color is different in the vertex set of same thread coloring.
Step 104：Judge whether the first vertex is identical with the second vertex color, if the first vertex and the second vertex color phase
Together, 105 are thened follow the steps.
Wherein, the first vertex is any vertex in vertex colored in step 103, and the second vertex is colored top
Any vertex adjacent with the first vertex in point, the first vertex and the second vertex are the top coloured respectively by different threads
Point.
The embodiment of the present invention in order to realize arbitrary neighborhood in figure two vertex different colors, to uncolored vertex
After being coloured, need to judge whether color is identical on adjacent vertex.Vertex inside one vertex set is due to by a thread
Coloring treatment is carried out, so that the color on these vertex can guarantee that color is different after the vertex coloring inside vertex set.But different top
Adjacent vertex between point set, it is identical so as to color due to being coloured by different threads, generate color conflict.It needs thus
Color conflict judgement is carried out to adjacent vertex, judge whether color is identical for the adjacent vertex coloured by different threads.
Judge whether the first vertex is identical with the second vertex color, if the first vertex is identical with the second vertex color, thens follow the steps
105.If the first vertex and the second vertex color difference, can not be handled the first vertex and the second vertex.
Step 105：It will be determined as uncoloured vertex one of in first vertex and the second vertex, and execute simultaneously
The step of enforcement colours the uncoloured vertex in different vertex sets with different threads, so that the first vertex and the second top
Point color is different.
When the first vertex is identical with the second vertex color, can will be determined one of in the first vertex and the second vertex
For uncoloured vertex, uncoloured vertex will be labeled as one of in the first vertex and the second vertex, with to label for
Uncoloured vertex carries out coloring treatment.
After being determined as uncoloured vertex one of in the first vertex and the second vertex, processing equipment executes again
Step 103, so that the first vertex and the second vertex color difference.
In order to guarantee that any vertex in figure is different with its adjacent any vertex color, the processing of the embodiment of the present invention is set
It is standby that step 103-105 can be performed a plurality of times, until the adjacent vertex color in figure is all different.
In conclusion the figure including multiple uncoloured vertex is obtained in the processing equipment for including at least two threads,
It then, is at least two vertex sets by multiple uncoloured vertex partitions.Parallel using different threads in different vertex sets
Uncoloured vertex is coloured, and colored vertex is obtained.And then, judge the first vertex whether with the second vertex color phase
Together, wherein the first vertex be colored vertex in any vertex, the second vertex be colored vertex in the first vertex
Adjacent any vertex, the first vertex and the second vertex are the vertex coloured respectively by different threads.If the first vertex
It is identical with the second vertex color, then it will be determined as uncoloured vertex one of in the first vertex and the second vertex, and
Execute parallel using different threads the uncoloured vertex in different vertex sets is coloured the step of so that the first vertex and
Second vertex color is different.In this way, uncoloured vertex is grouped, it is parallel using not after obtaining at least two vertex sets
Same thread carries out coloring treatment to different vertex sets, and the colouring task for realizing opposite vertexes is divided, simultaneously by multithreading
Row processing, so that the time-consuming that opposite vertexes are coloured is reduced, in addition, when the first adjacent vertex is identical with the second vertex color
When, it returns and executes the step of colouring parallel using different threads to the uncoloured vertex in different vertex sets, so that the
One vertex and the second vertex color difference, after ensure that the vertex coloring to figure, color is different between adjacent vertex.
Fig. 2 is a kind of flow chart of figure vertex coloring method provided in an embodiment of the present invention.The method of embodiment illustrated in fig. 2
It can be realized based on the method for embodiment illustrated in fig. 1.The figure vertex coloring method of embodiment illustrated in fig. 2 can be applied to processing equipment
On, wherein processing equipment includes at least two threads.The figure vertex coloring method of embodiment illustrated in fig. 2, specifically includes 3 masters
Want step：1) the determining thread for colouring parallel, 2) coloured parallel using thread opposite vertexes, 3) color conflict detection.
Specific description as detailed below.
Referring to Fig.2, the figure vertex coloring method of the embodiment of the present invention includes：
Step 201：Obtain the figure including multiple uncoloured vertex.
Processing equipment obtains figure to be processed, which includes multiple uncoloured vertex, these vertex are top to be colored
Point.
Specific implementation about step 201 sees the specific descriptions of step 101.
Step 202：Determine the quantity TN of subject thread.
Wherein, TN is the positive integer more than or equal to 2, and subject thread is the thread for colouring parallel.The subject thread
Quantity can be equal to the processing equipment all threads or part thread that include.
In some embodiments, the quantity TN of subject thread is the maximum thread for colouring parallel that processing equipment is supported
Quantity.
About step 202 specific implementation there are many, wherein two example is shown as follows：
Example one：The quantity TN of subject thread is prestored on a processing device, and processing equipment is read from memory device should
The quantity TN of subject thread.
Example two：User obtains to the quantity TN or processing equipment of processing equipment input subject thread from other external equipments
Take the quantity TN of subject thread.
Example three：Obtain the central processor CPU nucleus number PN of processing equipment, wherein PN is positive integer, and then, processing is set
The standby quantity TN=PN-1 for determining subject thread.
It is appreciated that step 202 can execute before step 201, can also execute after step 201.
Step 203：It is TN vertex set by multiple uncoloured vertex partitions.
Processing equipment determines the quantity TN of subject thread, which is the thread for colouring parallel, in order to allow
Each subject thread can be assigned to vertex set, and sufficiently to use thread resources, processing equipment is by multiple uncoloured tops of figure
Point is divided into TN vertex set.Being specifically as follows all uncoloured vertex partitions of figure is TN vertex set.
It is appreciated that step 203 is one of the specific implementation of step 102.
It is appreciated that step 203 is there are many concrete implementation mode, for example, processing equipment is by multiple uncoloured vertex
It is averagely divided into TN vertex set, alternatively, processing equipment is according to preset quantity allotted, by multiple uncoloured vertex partitions
TN vertex set.
Optionally, in other embodiments of the invention, step 203 specifically includes step A1-A3.
Step A1：The quantity VN on multiple uncoloured vertex is calculated in processing equipment.Wherein, VN is more than or equal to 2
Positive integer.
Step A2：Processing equipment determines processing number of vertex VPT, wherein Indicate upward
It is rounded, VPT is positive integer.
Step A3：VN uncoloured vertex partitions are TN vertex set, so that at least TN- according to VPT by processing equipment
The uncoloured vertex quantity that 1 vertex set includes is VPT.
By the execution of step A1-A3, uncoloured vertex averagely maximumlly can be given to subject thread, thus
Thread resources are taken full advantage of, the efficiency of coloring is improved.
Optionally, the method for the embodiment of the present invention can be numbered the vertex of figure, thus using number opposite vertexes into
Row management, improves treatment effeciency, at this point, the specific implementation about step A3 can be：Using 1 to VN to VN not
The vertex of color carries out serial number, then, since the uncoloured vertex that number is 1, continuously not by every VPT number
The vertex partition of color is a vertex set, to obtain TN vertex set, and the uncoloured top that at least TN-1 vertex set includes
Point quantity is VPT.
Step 204：TN vertex set is assigned to different subject threads respectively.
After multiple uncoloured vertex partitions are TN vertex set by processing equipment, TN vertex set is assigned not respectively
Same subject thread, in other words, processing equipment assigns TN vertex set to TN graticule journey respectively, so that different subject threads
Corresponding different vertex set.
Step 205：It is uncoloured in the vertex set being imparted to each subject thread using each subject thread parallel
Vertex is coloured, and colored vertex is obtained.
After the vertex set that different subject threads is imparted to, processing equipment uses each subject thread to each target parallel
Uncoloured vertex in the vertex set that thread is imparted to is coloured, and is colored vertex by uncoloured vertex coloring.
In processing, colored vertex can be marked, labeled as colored vertex.
Specifically, step 205 can be the vertex being imparted to parallel using each subject thread to each subject thread
The uncoloured vertex concentrated is coloured, so as to include colored vertex in different vertex sets, and in each vertex set
Adjacent colored vertex color is different.For example, being carried out with traditional Wei Er surprise Powell method to the vertex of figure inside thread
Coloring, it is ensured that the vertex color that the inside of vertex set is colored is not identical.
It is appreciated that step 204 and 205 be step 103 one of specific implementation.
Step 206：Judge whether the first vertex is identical with the second vertex color, if the first vertex and the second vertex color phase
Together, 207 are thened follow the steps.
Wherein, the first vertex is any vertex in colored vertex, and the second vertex is in colored vertex with the
The adjacent any vertex in one vertex, the first vertex and the second vertex are the vertex coloured respectively by different threads.
After all subject threads complete the coloring treatment to the vertex set progress being imparted to, processing equipment carries out color
Collision detection judges whether the colored vertex of figure is identical with adjacent colored vertex color.For this purpose, processing equipment
Execute step 206.To any vertex in colored vertex, judge whether color is identical on any vertex adjacent thereto, i.e.,
Judge whether the first vertex is identical with the second vertex color, if the first vertex is identical with the second vertex color, thens follow the steps
207, otherwise, without processing.
Step 207：It will be determined as uncoloured vertex one of in first vertex and the second vertex.And it executes simultaneously
The step of uncoloured vertex in the vertex set being imparted to each subject thread to each subject thread colours is exercised,
So that the first vertex and the second vertex color difference.
When the first vertex is identical with the second vertex color, processing equipment by the first vertex and the second vertex wherein it
One is determined as uncoloured vertex.Being specifically as follows will be one of in the first vertex and the second vertex labeled as uncoloured
Vertex.
In the embodiment that opposite vertexes are numbered, compared with numbering small vertex, carried out again to big vertex is numbered
Coloring is smaller on the influence of other vertex, at this point, optionally, step 207 specifically includes：It will be in the first vertex and the second vertex
It numbers big vertex and is determined as uncoloured vertex.
After being determined as uncoloured vertex one of in the first vertex and the second vertex, processing equipment executes again
Step 205, so that the first vertex and the second vertex color difference.
For example, when colouring first time, processing equipment executes step 205, parallel using each subject thread to each mesh
Uncoloured vertex in the vertex set that graticule journey is imparted to is coloured, and colored vertex is obtained.After coloring, processing equipment
When executing step 206, judge that the number on the vertex and the coloring of another thread that the number of thread coloring is 3 is 102
Vertex color is all red, and two vertex are adjacent.Then, processing equipment executes step 207, will number the top for being 102
Point is labeled as uncolored.Similarly, processing equipment also judges other need labeled as uncoloured colored vertex.Then,
Processing equipment executes step 205 again, carries out second and colours, at this point, processing equipment can be according to first time coloring as a result, making
Uncoloured vertex is carried out with different from colouring for the first time order of colors or using the color different with colouring for the first time
Then coloring executes step 206 again, until all adjacent vertex colors are different.
In order to guarantee that any vertex in figure is different with its adjacent any vertex color, the processing of the embodiment of the present invention is set
It is standby that step 205-207 can be performed a plurality of times, until the adjacent vertex color in figure is all different.
In conclusion the figure including multiple uncoloured vertex is obtained in the processing equipment for including at least two threads,
It then, is at least two vertex sets by multiple uncoloured vertex partitions.Parallel using different threads in different vertex sets
Uncoloured vertex is coloured, and colored vertex is obtained.And then, judge the first vertex whether with the second vertex color phase
Together, wherein the first vertex be colored vertex in any vertex, the second vertex be colored vertex in the first vertex
Adjacent any vertex, the first vertex and the second vertex are the vertex coloured respectively by different threads.If the first vertex
It is identical with the second vertex color, then it will be determined as uncoloured vertex one of in the first vertex and the second vertex, and
Execute parallel using different threads the uncoloured vertex in different vertex sets is coloured the step of so that the first vertex and
Second vertex color is different.In this way, uncoloured vertex is grouped, it is parallel using not after obtaining at least two vertex sets
Same thread carries out coloring treatment to different vertex sets, and the colouring task for realizing opposite vertexes is divided, simultaneously by multithreading
Row processing, so that the time-consuming that opposite vertexes are coloured is reduced, in addition, when the first adjacent vertex is identical with the second vertex color
When, it returns and executes the step of colouring parallel using different threads to the uncoloured vertex in different vertex sets, so that the
One vertex and the second vertex color difference, after ensure that the vertex coloring to figure, color is different between adjacent vertex.
In order to have more intuitive understanding to figure vertex coloring method provided in an embodiment of the present invention, below based on Fig. 1 and Fig. 2
The method of illustrated embodiment is described in detail the figure vertex coloring method of the embodiment of the present invention in conjunction with specific scene.
The figure vertex coloring method of the embodiment of the present invention, specifically includes 3 key steps：1) determination is used to colour parallel
Thread, 2) coloured parallel using thread opposite vertexes, 3) coloring collision detection.Specific description as detailed below.
1) thread for colouring parallel is determined
The figure vertex coloring method of the embodiment of the present invention determines the thread for colouring parallel, can be acquisition processing equipment
System support maximum thread.By determining for the thread that colours parallel, can determine to carry out coloring treatment and
Row degree.
For this purpose, processing equipment needs to obtain the CPU core number of processing equipment.
Specifically, on windows platform, C/C++ language only needs following code to can be obtained CPU core number：
#include"windows.h"
SYSTEM_INFO sysInfo；
GetSystemInfo(&sysInfo)；
PN=sysInfo.dwNumberOfProcessors；
And in Linux platform, the code that C/C++ obtains CPU core number is as follows：
#include"unistd.h"
PN=sysconf (_ SC_NPROCESSORS_CONF)；
// obtain real available CPU core number in current system
PN=sysconf (_ SC_NPROCESSORS_ONLN)；
Wherein, PN indicates CPU core number.Processing equipment determines that the number of threads for colouring parallel is TN.PN is positive integer,
TN is the positive integer more than or equal to 2.
As PN >=2, TN=PN-1.This way it is ensured that the cpu resource that main thread needs.If PN < 2, then TN=
PN, main thread does not occupy cpu resource individually at this time.
The number of threads TN for colouring parallel obtained in this way is the maximum thread that processing equipment is supported while being run
Amount.
2) it is coloured parallel using thread opposite vertexes
After processing equipment obtains the figure including multiple uncoloured vertex, the number on the uncoloured vertex of the figure is calculated
Measure VN.Then, use 1 carries out serial number to the VN uncoloured vertex to VN, i.e. vertex number is continuous to compile since 1
Number to the last until a vertex number VN.Wherein, VN is the positive integer more than or equal to 2.
Execution through the above steps, processing equipment determine that the number of threads for colouring parallel is TN.In this way, each line
The manageable vertex quantity of journeyWherein, symbolExpression rounds up.In this way, processing is set
The standby uncoloured vertex for being 1 since number, numbering continuous uncoloured vertex partition for every VPT is a vertex
Collection, to obtain TN vertex set.At this point, the uncoloured vertex quantity that at least TN-1 vertex set includes is VPT.And then, locate
Reason equipment assigns the TN vertex set to different threads respectively, i.e., using number be 1 to 1 × VPT uncoloured vertex as
One vertex set assigns 1 thread, and the uncoloured vertex for being VPI+1 to 2 × VPT using number is as another vertex
Collection assigns another thread, and so on, complete the operation that TN vertex set is assigned to different threads respectively.Wherein, VPT is
Positive integer.
Then, the uncoloured vertex in vertex set that processing equipment is imparted to each thread using each thread parallel
It is coloured, obtains colored vertex.
3) collision detection is coloured.
After being coloured using traditional Wei Er surprise Powell method etc. to the vertex of figure inside thread, inside vertex set
Adjacent vertex color is different in vertex, but each thread is giving adjacent top that is having side to be connected but distributing to different threads processing
When putting while being coloured, it may cause these adjacent tops and light same color, namely coloring conflict occur.Coloring conflict
Readily occur in that number is close and among the close vertex set of interconnection, i.e., coloring conflict is from having that side is connected but distribute to
The adjacent vertex of those of different threads processing.Therefore, coloring conflict is carried out after each coloring to check, of the invention real
It applies in example, biggish vertex is numbered into the centering of the identical adjacent vertex of color, put back to uncolored concentration again and restain, i.e.,
The uncoloured vertex executed in the vertex set that processing equipment is parallel imparted to each thread using each thread colours,
The step of obtaining colored vertex.Then coloring collision detection is carried out again, thus, loop iteration, until no longer conflicting
Until.The vertex quantity for needing to restain due to conflict can all decline rapidly after every time circulation, aforementioned circulation
Speed can be getting faster.
By above-mentioned 2) it carries out coloring using thread opposite vertexes parallel and 3) colours collision detection to be expressed as follows with pseudo-code：
// coloured parallel using thread opposite vertexes
The colored number of vertex of while<VN
{
ColoringVert (vert []) // shading function：It is coloured to vertex set, vert [] indicates vertex set
ConfDetecReColoring (vert []) // collision detection and restain function
}
// shading function
ColoringVert(vert[])
{
For each vert perform Parallel//parallelization shading operations are executed to each vertex
If not Colored Then//whether not yet coloured？
Coloring vert//coloured
Tag vert as Colored//by the apex marker be it is colored
}
// collision detection and restain function
ConfDetecReColoring(vert[])
For each vert//coloring collision detection is carried out to each vertex
All vertex for vert_nb in neighbor (vert) // cycle detection vertex v ert adjacent thereto
If if vert.color==vert_nb.color Then//identical as neighbouring vertices color
Tag vert as NotColored//by vertex v ert be labeled as uncolored vertex.
It, will compared with existing serial color method after the figure vertex coloring method of the specific scene of above-mentioned combination
It is time-consuming coloring to be reduced.Specific compliance test result is as follows：
Using six group pictures described in table 1, the essential attribute of six group picture is as shown in table 1.
Table 1：Six group picture essential attributes
The embodiment of the present invention carrys out relatively this hair from two main indicators of minimum chromatic number that coloring time-consuming and coloring need respectively
The superiority and inferiority of the figure vertex coloring method of bright embodiment and existing serialization color rendering intent.Wherein, intuitive and simple for description
It is clean, in the compliance test result of the embodiment of the present invention, the figure vertex coloring method of the embodiment of the present invention is referred to as parallelization coloring
Existing serialization color rendering intent is referred to as to serialize colouring algorithm by algorithm.
1) parallelization colouring algorithm and serialization colouring algorithm time-consuming comparison.
For selecting Avg_0 figure, respectively with the figure vertex coloring method of the parallelization of the embodiment of the present invention and existing
Two methods of color rendering intent are serialized to Avg_0 graph coloring, the time-consuming obtained is as shown in table 2, when Thread Count is 1, parallelization
Colouring algorithm is degenerated for serialization colouring algorithm.
Table 2：Colouring algorithm is time-consuming
| Thread Count | Colour time-consuming (s) |
| 1 | 263.42 |
| 2 | 161.81 |
| 4 | 90.79 |
| 8 | 56.95 |
| 16 | 35.07 |
| 32 | 23.13 |
The figure vertex coloring method of the embodiment of the present invention and existing serialization color rendering intent time-consuming are as shown in figure 3, from Fig. 3
As can be seen that the figure vertex coloring method of the embodiment of the present invention is than existing with the raising (Thread Count increase) of parallelization degree
Serialization color rendering intent coloring time-consuming gradually decrease (but not in a linear relationship), therefore, the parallelization of the embodiment of the present invention
Figure vertex coloring method in terms of colouring time-consuming have more advantage.
2) parallelization colouring algorithm and serialization colouring algorithm need minimum chromatic number comparison to be used.
The figure vertex coloring method of the parallelization of the embodiment of the present invention is used to following 6 group picture respectively and existing is serialized
Color scheme executes, and obtaining needs minimum chromatic number to be used, as shown in table 3.
3 two kinds of color methods of table need minimum chromatic number to be used
Wherein, two schemes need minimum chromatic number (number of colours at least used) to be used to compare as shown in Figure 4.
As can be seen from Figure 4, increasing with the number of vertex of figure, needing minimum chromatic number to be used is also show an ascending trend, but this
The figure vertex coloring method of inventive embodiments is consistent with minimum chromatic number required for existing serialization color rendering intent.
In conclusion when carrying out figure vertex coloring, using the figure vertex coloring method of the embodiment of the present invention, in graph coloring
Time-consuming aspect has more advantage than traditional serialization color rendering intent, and in terms of needing minimum chromatic number M to be used, the present invention is implemented
The figure vertex coloring method of example can also reach and traditional comparable level of serialization color rendering intent, therefore, the embodiment of the present invention
Parallelization figure vertex coloring method be better than existing serialization color rendering intent.
Fig. 5 is a kind of structural schematic diagram of processing equipment provided in an embodiment of the present invention, and processing equipment shown in fig. 5 is available
In the figure vertex coloring method for executing Fig. 1 and embodiment illustrated in fig. 2.
Refering to Fig. 5, the processing equipment of the embodiment of the present invention includes at least two threads, and processing equipment includes：Acquiring unit
501, division unit 502, coloring units 503, judging unit 504, determination unit 505.
Acquiring unit 501 is for obtaining the figure including multiple uncoloured vertex；Division unit 502 be used for by it is multiple not
The vertex partition of color is at least two vertex sets；Coloring units 503 are for parallel using different threads in different vertex sets
Uncoloured vertex is coloured, and colored vertex is obtained；Judging unit 504 is used to judge whether the first vertex to push up with second
Point color it is identical, wherein the first vertex be colored vertex in any vertex, the second vertex be colored vertex in
The adjacent any vertex in first vertex, the first vertex and the second vertex are the vertex coloured respectively by different threads；Really
If order member 505 is identical with the second vertex color for the first vertex, will be one of in the first vertex and the second vertex
It is determined as uncoloured vertex；Coloring units 503 be also used to execute it is parallel using different threads in different vertex sets not
The step of vertex of color is coloured, so that the first vertex and the second vertex color difference.
Optionally, processing equipment further includes quantity determination unit 506；
Quantity determination unit 506 is used to determine that the quantity TN, TN of subject thread to be the positive integer more than or equal to 2, target
Thread is the thread for colouring parallel；Division unit 502 is also used to multiple uncoloured vertex partitions be TN vertex set；
Coloring units 503 include assigning module 507 and staining module 508；
Module 507 is assigned for TN vertex set to be assigned to different subject threads respectively；
In vertex set of the staining module 508 for being imparted to parallel using each subject thread to each subject thread not
The vertex of coloring is coloured, and colored vertex is obtained.
When in use, it includes multiple uncoloured vertex that acquiring unit 501 obtains to the processing equipment of the embodiment of the present invention
Multiple uncoloured vertex partitions are at least two vertex sets by figure, then, division unit 502.Coloring units 503 use parallel
Different threads colour the uncoloured vertex in different vertex sets, obtain colored vertex.In this way, realizing to top
The colouring task of point is divided, by multi-threading parallel process, to reduce the time-consuming that opposite vertexes are coloured.
After thread coloring, judging unit 504 judges whether the first vertex is identical with the second vertex color, wherein the first top
Point is any vertex in colored vertex, and the second vertex is any top adjacent with the first vertex in colored vertex
Point, the first vertex and the second vertex are the vertex coloured respectively by different threads.If the first vertex and the second vertex face
Color is identical, produces coloring conflict, it is determined that unit 505 will be determined as not one of in first vertex and the second vertex
The vertex of color.And then, coloring units 503, which execute, parallel carries out the uncoloured vertex in different vertex sets using different threads
The step of coloring, so that the first vertex and the second vertex color difference.This way it is ensured that after to the vertex coloring of figure, it is adjacent
Color is different between vertex.
The embodiment of the invention also provides a kind of storage mediums, are stored with processor-executable instruction, described instruction
It is loaded by one or more processors, to execute the figure vertex coloring method such as above-mentioned Fig. 1 and embodiment illustrated in fig. 2.
There is provided herein the various operations of embodiment.In one embodiment, one or more operations can be with structure
At the computer-readable instruction stored on one or more computer-readable mediums, will make to succeed in one's scheme when being executed by electronic equipment
It calculates equipment and executes the operation.Describing the sequences of some or all of operations, to should not be construed as to imply that these operations necessarily suitable
Sequence is relevant.It will be appreciated by those skilled in the art that the alternative sequence of the benefit with this specification.Furthermore, it is to be understood that
Not all operation must exist in each embodiment provided in this article.
Moreover, although the disclosure, this field skill has shown and described relative to one or more implementations
Art personnel will be appreciated that equivalent variations and modification based on the reading and understanding to the specification and drawings.The disclosure include it is all this
The modifications and variations of sample, and be limited only by the scope of the following claims.In particular, to by said modules (such as element,
Resource etc.) the various functions that execute, term for describing such components is intended to correspond to the specified function for executing the component
The random component (unless otherwise instructed) of energy (such as it is functionally of equal value), even if illustrated herein with execution in structure
The disclosure exemplary implementations in function open structure it is not equivalent.In addition, although the special characteristic of the disclosure
Through being disclosed relative to the only one in several implementations, but this feature can with such as can be to given or specific application
For be expectation and one or more other features combinations of other advantageous implementations.Moreover, with regard to term " includes ", " tool
Have ", " containing " or its deformation be used in specific embodiments or claims for, such term be intended to with term
The similar mode of "comprising" includes.
Each functional unit in the embodiment of the present invention can integrate in a processing module, be also possible to each unit list
It is solely physically present, can also be integrated in two or more units in a module.Above-mentioned integrated module can both use
Formal implementation of hardware can also be realized in the form of software function module.If the integrated module is with software function
The form of module is realized and when sold or used as an independent product, also can store in computer-readable storage Jie
In matter.Storage medium mentioned above can be read-only memory, disk or CD etc..Above-mentioned each device or system, can be with
Execute the method in correlation method embodiment.
Although the serial number before embodiment only makes for convenience of description in conclusion the present invention is disclosed above with embodiment
With not causing to limit to the sequence of various embodiments of the present invention.Also, above-described embodiment is not intended to limit the invention, this field
Those of ordinary skill, without departing from the spirit and scope of the present invention, can make it is various change and retouch, therefore it is of the invention
Protection scope subjects to the scope of the claims.
Claims (10)
1. a kind of figure vertex coloring method, which is characterized in that the method is applied to processing equipment, and the processing equipment includes extremely
Few two threads, the method includes：
Obtain the figure including multiple uncoloured vertex；
It is at least two vertex sets by the multiple uncoloured vertex partition；
The uncoloured vertex in different vertex sets is coloured using different threads parallel, obtains colored vertex；
Judge whether the first vertex is identical with the second vertex color, wherein first vertex is in the colored vertex
Any vertex, second vertex is any vertex adjacent with first vertex in the colored vertex, described
First vertex and second vertex are the vertex coloured respectively by different threads；
If first vertex is identical with second vertex color, by its in first vertex and second vertex
One of be determined as uncoloured vertex, and execute it is described it is parallel using different threads to uncoloured in different vertex sets
The step of vertex is coloured, so that first vertex is different with second vertex color.
2. figure vertex coloring method according to claim 1, which is characterized in that
It is described by the multiple uncoloured vertex partition be at least two vertex sets before, the method also includes：
Determine that the quantity TN of subject thread, the TN are the positive integer more than or equal to 2, the subject thread is for parallel
The thread of color；
It is described by the multiple uncoloured vertex partition be at least two vertex sets, including：
It is TN vertex set by the multiple uncoloured vertex partition；
It is described it is parallel the uncoloured vertex in different vertex sets is coloured using different threads, obtain colored top
Point, including：
Assign the TN vertex set to different subject threads respectively；
Uncoloured vertex in the vertex set being imparted to parallel using each subject thread to each subject thread is coloured,
Obtain colored vertex.
3. figure vertex coloring method according to claim 2, which is characterized in that
It is described by the multiple uncoloured vertex partition be TN vertex set, including：
The quantity VN, the VN that the multiple uncoloured vertex is calculated are the positive integer more than or equal to 2；
Determine processing number of vertex VPT, wherein described Expression rounds up, and the VPT is positive
Integer；
It is TN vertex set by VN uncoloured vertex partitions, so that at least TN-1 vertex set includes according to the VPT
Uncoloured vertex quantity is VPT.
4. figure vertex coloring method according to claim 3, which is characterized in that
It is described according to the VPT, be TN vertex set by VN uncoloured vertex partitions, so that at least TN-1 vertex set packet
The uncoloured vertex quantity included is VPT, including：
Serial number is carried out to VN uncoloured vertex using 1 to VN；
Since the uncoloured vertex that number is 1, numbering continuous uncoloured vertex partition for every VPT is a vertex
Collection, to obtain TN vertex set, and the uncoloured vertex quantity that at least TN-1 vertex set includes is VPT.
5. figure vertex coloring method according to claim 4, which is characterized in that
It is described to be determined as uncoloured vertex one of in first vertex and second vertex, including：
The big vertex of number in first vertex and second vertex is determined as uncoloured vertex.
6. according to the described in any item figure vertex coloring methods of claim 2-5, which is characterized in that
The quantity TN of the determining subject thread, including：
Central processor CPU the nucleus number PN, the PN for obtaining the processing equipment are positive integer；
Determine the quantity TN=PN-1 of subject thread.
7. figure vertex coloring method according to claim 1-5, which is characterized in that
It is described it is parallel the uncoloured vertex in different vertex sets is coloured using different threads, obtain colored top
Point, including：
The uncoloured vertex in different vertex sets is coloured using different threads parallel, so as to include in different vertex sets
Colored vertex, and the adjacent colored vertex color in each vertex set is different.
8. a kind of processing equipment, which is characterized in that the processing equipment includes at least two threads, and the processing equipment includes：
Acquiring unit, for obtaining the figure including multiple uncoloured vertex；
Division unit, for being at least two vertex sets by the multiple uncoloured vertex partition；
Coloring units are obtained for being coloured parallel using different threads to the uncoloured vertex in different vertex sets
The vertex of coloring；
Judging unit, for judge whether the first vertex identical with the second vertex color, wherein first vertex be described in
Any vertex in the vertex of coloring, second vertex are adjacent with first vertex in the colored vertex appoint
One vertex, first vertex and second vertex are the vertex coloured respectively by different threads；
Determination unit, if identical with second vertex color for first vertex, by first vertex and described
It is determined as uncoloured vertex one of in second vertex；
The coloring units, be also used to execute it is described it is parallel using different threads to the uncoloured vertex in different vertex sets into
The step of row coloring, so that first vertex is different with second vertex color.
9. processing equipment according to claim 8, which is characterized in that
The processing equipment further includes quantity determination unit；
The quantity determination unit, for determining that the quantity TN, the TN of subject thread are the positive integer more than or equal to 2, institute
Stating subject thread is the thread for colouring parallel；
The division unit is also used to the multiple uncoloured vertex partition be TN vertex set；
The coloring units include assigning module and staining module；
The imparting module, for assigning the TN vertex set to different subject threads respectively；
The staining module, in the vertex set for being imparted to parallel using each subject thread to each subject thread not
The vertex of color is coloured, and colored vertex is obtained.
10. a kind of storage medium is stored with processor-executable instruction, described instruction is by one or more processors
Load, to execute such as figure vertex coloring method any in claim 1-7.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201810597255.9A CN108876874A (en) | 2018-06-11 | 2018-06-11 | Figure vertex coloring method, processing equipment and storage medium |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201810597255.9A CN108876874A (en) | 2018-06-11 | 2018-06-11 | Figure vertex coloring method, processing equipment and storage medium |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN108876874A true CN108876874A (en) | 2018-11-23 |
Family
ID=64337811
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201810597255.9A Pending CN108876874A (en) | 2018-06-11 | 2018-06-11 | Figure vertex coloring method, processing equipment and storage medium |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN108876874A (en) |
Cited By (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN112150581A (en) * | 2020-08-19 | 2020-12-29 | 中国海洋大学 | Distributed self-adaptive graph vertex coloring method and system |
| CN112581563A (en) * | 2020-12-17 | 2021-03-30 | 全芯智造技术有限公司 | Geometry rendering method, electronic device, and computer-readable storage medium |
Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20130297605A1 (en) * | 2012-05-01 | 2013-11-07 | Nvidia Corporation | System, method, and computer program product for performing graph coloring |
| CN103914866A (en) * | 2014-03-14 | 2014-07-09 | 浙江工商大学 | 3D model grouping method based on self-adaptive graph coloring in wireless network |
| CN103995725A (en) * | 2014-04-24 | 2014-08-20 | 深圳中微电科技有限公司 | Method and device for executing program converting of pixel shader on CPU |
| CN104835110A (en) * | 2015-04-15 | 2015-08-12 | 华中科技大学 | Asynchronous graphic data processing system based on GPU |
| CN108132838A (en) * | 2016-11-30 | 2018-06-08 | 华为技术有限公司 | A kind of method, apparatus and system of diagram data processing |
-
2018
- 2018-06-11 CN CN201810597255.9A patent/CN108876874A/en active Pending
Patent Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20130297605A1 (en) * | 2012-05-01 | 2013-11-07 | Nvidia Corporation | System, method, and computer program product for performing graph coloring |
| CN103914866A (en) * | 2014-03-14 | 2014-07-09 | 浙江工商大学 | 3D model grouping method based on self-adaptive graph coloring in wireless network |
| CN103995725A (en) * | 2014-04-24 | 2014-08-20 | 深圳中微电科技有限公司 | Method and device for executing program converting of pixel shader on CPU |
| CN104835110A (en) * | 2015-04-15 | 2015-08-12 | 华中科技大学 | Asynchronous graphic data processing system based on GPU |
| CN108132838A (en) * | 2016-11-30 | 2018-06-08 | 华为技术有限公司 | A kind of method, apparatus and system of diagram data processing |
Cited By (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN112150581A (en) * | 2020-08-19 | 2020-12-29 | 中国海洋大学 | Distributed self-adaptive graph vertex coloring method and system |
| CN112150581B (en) * | 2020-08-19 | 2022-09-30 | 中国海洋大学 | Distributed self-adaptive graph vertex coloring method and system |
| CN112581563A (en) * | 2020-12-17 | 2021-03-30 | 全芯智造技术有限公司 | Geometry rendering method, electronic device, and computer-readable storage medium |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| Craig et al. | Test scheduling and control for VLSI built-in self-test | |
| Perra et al. | Random walks and search in time-varying networks | |
| Hopcroft et al. | Linear time algorithm for isomorphism of planar graphs (preliminary report) | |
| Everett et al. | Analyzing clique overlap | |
| Sels et al. | Hybrid tabu search and a truncated branch-and-bound for the unrelated parallel machine scheduling problem | |
| CN106909543B (en) | Pattern matching method and device of rule engine | |
| CN108876874A (en) | Figure vertex coloring method, processing equipment and storage medium | |
| CN110225095A (en) | A kind of data processing method, apparatus and system | |
| Misale et al. | It's a Scheduling Affair: GROMACS in the Cloud with the KubeFlux Scheduler | |
| Lotfi et al. | A graph coloring algorithm for large scale scheduling problems | |
| Narayanan et al. | Optimal Seguencing of Scan Registers | |
| Srinivasan et al. | A cleanup algorithm for implementing storage constraints in scientific workflow executions | |
| Roberts et al. | Data migration algorithms in heterogeneous storage systems: A comparative performance evaluation | |
| Yang et al. | Efficient dense structure mining using mapreduce | |
| CN106997411B (en) | Coloring Petri net capability mission thread form description and verification method | |
| Jin et al. | A center-based community detection method in weighted networks | |
| Muresan et al. | The left edge algorithm and the tree growing technique in block-test scheduling under power constraints | |
| Şeker et al. | A decomposition approach to solve the selective graph coloring problem in some perfect graph families | |
| Wang et al. | Monte carlo tree search for task mapping onto heterogeneous platforms | |
| Carrington et al. | An enhanced weighted graph model for examination/course timetabling | |
| Zhang et al. | Towards backbone computing: A Greedy-Whitening based approach | |
| Dias et al. | Integer and constraint programming approaches for providing optimality to the bandwidth multicoloring problem | |
| Chen et al. | Topology visualization in optical backbone transport network planning | |
| Nayyaroddeen et al. | A study of graph decomposition algorithms for parallel symmetry breaking | |
| Moalic et al. | The sum coloring problem: a memetic algorithm based on two individuals |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| WD01 | Invention patent application deemed withdrawn after publication | ||
| WD01 | Invention patent application deemed withdrawn after publication |
Application publication date: 20181123 |