DocumentCode :
2978566
Title :
The Application of Parallel Computing in Research on the Domination Number of Graph
Author :
Fu Xueliang ; Hu Hua
Author_Institution :
High Performance Comput. Center, Inner Mongolia Agric. Univ., Hohhot, China
fYear :
2010
fDate :
29-31 Oct. 2010
Firstpage :
1
Lastpage :
3
Abstract :
A parallel computation was built in high performance computing cluster(HPC). In the Cluster, each natural number less than or equal to vertices number of the graph has been tested with a cluster node. The minimal domination number (MDN) was worked out efficiently. In this study, taking W(3,n) Knödel graph for an example, the sharp bounds of the MDN has been gave out by parallel computation and a accuracy proof of MDN is provided.
Keywords :
graph theory; parallel processing; Knödel graph; cluster node; graph domination number; high performance computing cluster; minimal domination number; parallel computing; Clustering algorithms; Computers; High performance computing; Parallel processing; Program processors; Testing;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Multimedia Technology (ICMT), 2010 International Conference on
Conference_Location :
Ningbo
Print_ISBN :
978-1-4244-7871-2
Type :
conf
DOI :
10.1109/ICMULT.2010.5629815
Filename :
5629815
Link To Document :
بازگشت