Please log in to take part in the discussion (add own reviews or comments).
Cite this publication
More citation styles
- please select -
%0 Conference Paper
%1 conf/icic/ZhouNZ08
%A Zhou, Dongming
%A Nie, Rencan
%A Zhao, Dongfeng
%B ICIC (2)
%D 2008
%E Huang, De-Shuang
%E II, Donald C. Wunsch
%E Levine, Daniel S.
%E Jo, Kang-Hyun
%I Springer
%K dblp
%P 9-18
%T A New Algorithm for Finding the Shortest Path Tree Using Competitive Pulse Coupled Neural Network.
%U http://dblp.uni-trier.de/db/conf/icic/icic2008-2.html#ZhouNZ08
%V 5227
%@ 978-3-540-85983-3
@inproceedings{conf/icic/ZhouNZ08,
added-at = {2017-05-23T00:00:00.000+0200},
author = {Zhou, Dongming and Nie, Rencan and Zhao, Dongfeng},
biburl = {https://puma.ub.uni-stuttgart.de/bibtex/29e30ab80f447a8ee84d685508dec8122/dblp},
booktitle = {ICIC (2)},
crossref = {conf/icic/2008-2},
editor = {Huang, De-Shuang and II, Donald C. Wunsch and Levine, Daniel S. and Jo, Kang-Hyun},
ee = {https://doi.org/10.1007/978-3-540-85984-0_2},
interhash = {baa3663233699e4f533c898249d7c3f2},
intrahash = {9e30ab80f447a8ee84d685508dec8122},
isbn = {978-3-540-85983-3},
keywords = {dblp},
pages = {9-18},
publisher = {Springer},
series = {Lecture Notes in Computer Science},
timestamp = {2019-09-27T15:31:31.000+0200},
title = {A New Algorithm for Finding the Shortest Path Tree Using Competitive Pulse Coupled Neural Network.},
url = {http://dblp.uni-trier.de/db/conf/icic/icic2008-2.html#ZhouNZ08},
volume = 5227,
year = 2008
}
