• No results found

An Exact Parallel Algorithm for the Radio k-coloring Problem

N/A
N/A
Protected

Academic year: 2020

Share "An Exact Parallel Algorithm for the Radio k-coloring Problem"

Copied!
14
0
0

Loading.... (view fulltext now)

Full text

Loading

Figure

Table 1: All possible combinations for the graph G with order n and upper bound k = 4
Table 2: Comparison among Ub0, Ub1, Ub2, St and Ex for the radio number of path graph
Table 3: Comparison among Ub0,Ub1, Ub2, St and Ex for the radio number of cycle graph
Table 4: PAlgorithm 1 ( the upper bound of the radio number) for size 1000 of cycle
+3

References

Related documents

We note that Lactobacilli constitute the majority of the pro- biotic bacteria population in the dietary supplements (Table 1) and have therefore excluded contributions of

A model is developed on predictors of work-family conflict which suggests that the predictors could be job-related (job type, work time commitment, job involvement,

At a concentration of 1 mM silver ions, it is showing intracellular formation of silver nanoparticles, while in the case of other concentrations nanoparticles are

With the supervised parallel corpus which are consist of paraphrase questions that either handwritten or extracted from the community- based QA databases, this method can generate

The present study defines RbcX as an assembly chaperone of form I RuBisCO from cyanobacteria and resulted in the following model of RuBisCO folding and assembly:

The formation process of relationship marketing refers to decisions regarding initiation of relationship marketing activities for a firm with respect to a specific group of customers

The two-drop policy applies to all drops taken at the University of Florida during the first 60 hours of course work regardless of whether the student was in the Fisher School

• Statement of purpose discussing research interests All components of the application must be complete by the March 15 application date. Students should consult the graduate