DocumentCode :
2164310
Title :
The implementation of parallel computing on the domination number of graph
Author :
Junqing, Ma ; Xueliang, Fu ; Hua, Hu
Author_Institution :
College of Computer and Information Engineering Inner Mongolia Agriculture University Hohhot, 010018, China
fYear :
2010
fDate :
4-6 Dec. 2010
Firstpage :
5497
Lastpage :
5499
Abstract :
The high performance computing cluster(HPC) administered a parallel computation. A cluster node which consisted of Cluster was in charge of examining each natural number less than or equal to vertices number of the graph. The cluster can calculate the minimal domination number (MDN) effectively. In this paper, taking W(3,n) Knödel graph for an example, the definit bounds of the MDN has been worked out by parallel computation and it has been proved correctly by mathematical proof.
Keywords :
Agriculture; Computers; Educational institutions; High performance computing; Mathematics; Parallel processing; Performance evaluation; Cluster; Knödel graph domination number; high performance computing;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Information Science and Engineering (ICISE), 2010 2nd International Conference on
Conference_Location :
Hangzhou, China
Print_ISBN :
978-1-4244-7616-9
Type :
conf
DOI :
10.1109/ICISE.2010.5691879
Filename :
5691879
Link To Document :
بازگشت