Name
Abstract | ||
|---|---|---|
In order to deduce operating steps and improve efficient to solve the problems, multi-separation techniques was proposed; a multi-separation model was designed, too. Based on the vast parallelism of sticker model, the problem was solved by using the idea of transforming the problem into satisfiability problem. The multi-separation techniques were implied to solve the graph vertex-coloring problem. The operation steps were given through an instance. And the final coloring schemes were gotten. Consequently, the feasibility of the algorithm and the validity of multi-separation techniques were proved. |
Year | DOI | Venue |
|---|---|---|
2007 | 10.1109/IIH-MSP.2007.14 | IIH-MSP |
Keywords | Field | DocType |
vast parallelism,satisfiability problem,operation step,final coloring scheme,multi-separation model,sticker model,multi-separation technique,dna algorithm,graph vertex coloring problem,satisfiability,computability | Edge coloring,Complete coloring,Fractional coloring,Computer science,List coloring,Algorithm,Vertex cover,Greedy coloring,Feedback vertex set,Graph coloring | Conference |
ISBN | Citations | PageRank |
0-7695-2994-1 | 1 | 0.64 |
References | Authors | |
0 | 4 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Junjie Chen | 1 | 68 | 17.18 |
| Haifang Li | 2 | 12 | 4.86 |
| Yuxing Yang | 3 | 48 | 6.88 |
| Jilan Ma | 4 | 2 | 1.33 |