An algorithm for the minimum dominating set problem based on a new energy function

Proceedings of the SICE Annual Conference

Volumn , Issue , 2004, Pages 1825-1827

  Xu, Xinshun ^a   Tang, Zheng ^a   Sun, Weidong ^b   Chen, Xiaoming ^a   Li, Yong ^a   Xia, Guangpu ^a   Bi, Weixing ^a   Zong, Ziliang ^c  

^a UNIVERSITY OF TOYAMA   (Japan)

^b Japan Open System   (Japan)

^c SHANDONG UNIVERSITY   (China)

Author keywords

Dominating set problem; Hopfield neural network; NP hard problem

Indexed keywords

ALGORITHMS; COMBINATORIAL MATHEMATICS; COMPUTATIONAL COMPLEXITY; GRAPH THEORY; NEURAL NETWORKS; OPTIMIZATION; SET THEORY;

COMBINATORIAL OPTIMIZATION; DOMINATING SET PROBLEMS; HOPFIELD NEURAL NETWORKS; NETWORK NODES;

PROBLEM SOLVING;

EID: 12744280973     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (5)

1. J.Bar-Ilan, G.Kortsarz, and D. peleg. How to allocate nework centers, Journal of algorithms, Vol.15, pp. 385-415, 1993.
2. D. Peleg. Distributed data structures: A complexity oriented view. Proceedings of the 4th international workshop on distributed algorithms, pp. 71-89, September, 1990.
3. B. Liang and Z. Haas. Virtural backbone generation and maintenance in ad hoc network mobility management. In Proceeding of the 2000 IEEE INFOCOM, March 2000.
4. M.R. Garey and D.S. Johnson. Computers and Intractability: A Guide to the Theory of NP-completeness. Freeman, New York, 1979.
5. J.J. Hopfield and D.W. Tank, Neural Computation of Decisions in Optimization Problems, Biological Cybernetics 52 (1985) 141-152.