APA:
Patvardhan, C., Prakash, V. Prem, Srivastav, A. (2015). Fast heuristics for large instances of the euclidean bounded diameter minimum spanning tree problem.
Informatica (Ljubljana), letnik 39, številka 3, str. 281-292.
URN:NBN:SI:DOC-NJPJBCXP from http://www.dlib.si
MLA:
Patvardhan, C., Prakash, V. Prem, Srivastav, A.. "Fast heuristics for large instances of the euclidean bounded diameter minimum spanning tree problem."
Informatica (Ljubljana) letnik 39. številka 3 (2015) str. 281-292.
<http://www.dlib.si/?URN=URN:NBN:SI:DOC-NJPJBCXP>