loading...
Complexity Analysis for the HEWN Algorithm
Jinan, China October 16-October 18
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/ISDA.2006.125Sixth International Conference on Int ...
 This Article 
 
Buy PURCHASE ARTICLE: $19
PDF
HTML
Buy IEEE Xplore Subscribers
 
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
ASCII Text
x 
 
Aili Han, Daming Zhu, "Complexity Analysis for the HEWN Algorithm," Intelligent Systems Design and Applications, International Conference on, vol. 1, pp. 1015-1019, Sixth International Conference on Intelligent Systems Design and Applications (ISDA'06) Volume 1, 2006.
 
 
BibTex
x
 
@article{ 10.1109/ISDA.2006.125,
author = {Aili Han and Daming Zhu},
title = {Complexity Analysis for the HEWN Algorithm},
journal ={Intelligent Systems Design and Applications, International Conference on},
volume = {1},
year = {2006},
isbn = {0-7695-2528-8},
pages = {1015-1019},
doi = {http://doi.ieeecomputersociety.org/10.1109/ISDA.2006.125},
publisher = {IEEE Computer Society},
address = {Los Alamitos, CA, USA},
}
 
 
RefWorks Procite/RefMan/Endnote
x 
 
TY - CONF
JO - Intelligent Systems Design and Applications, International Conference on
TI - Complexity Analysis for the HEWN Algorithm
SN - 0-7695-2528-8
SP1015
EP1019
A1 - Aili Han,
A1 - Daming Zhu,
PY - 2006
KW - null
VL - 1
JA - Intelligent Systems Design and Applications, International Conference on
ER -
 
Aili Han, Shandong University at Weihai, China; Shandong University, China
Daming Zhu, Shandong University, China
A hierarchical edge-weight network (HEWN) of solving the maximum clique problem was presented in [1]. With the help of HEWN, the maximum clique problem was solved in polynomial time [1]. In this paper, the HEWN algorithm was anatomized with starting from the storage structure of HEWN. In the anatomizing procedure, by compared with the maximum complete subgraph tree (MCST) algorithm, we point out that when 2j>n, the underlying exponential times of creating and modifying the guiding matrices (GMs) exists in the HEWN algorithm, and its time complexity is O( j n C2j - ), where n is the number of the vertices in a graph and j is the size of the maximum clique in the graph.
Citation:
Aili Han, Daming Zhu, "Complexity Analysis for the HEWN Algorithm," isda, vol. 1, pp.1015-1019, Sixth International Conference on Intelligent Systems Design and Applications (ISDA'06) Volume 1, 2006
Usage of this product signifies your acceptance of the Terms of Use.