Solving bounded diameter minimum spnning tree problem using artificial bee colony algorithm by Rajiv Saxena; super vised by Alok Singh

Saxena, Rajiv
Call Number
PR001.6 Sa91S
Author
Saxena, Rajiv
Title
Solving bounded diameter minimum spnning tree problem using artificial bee colony algorithm by Rajiv Saxena; super vised by Alok Singh
Publication
Hyderabad: University of Hyderabad, 2009.
Physical Description
43p. ; with CD
Notes
Project Report(M.Tech) - Computer Science - Dept. of Computer and Information Science - School of MCIS - University of Hyderabad
Added Author
Singh, Alok; Supervisor
Subject
COMPUTER SCIENCE - PROJECT REPORT
Total Ratings: 0
Location Call Number Barcode Item Class Units Copy Number Status  
IGM Library PR001.6 Sa91S PR5370 Project Reports 1 Available
 
 
 
00911nam a2200205 a 4500
001
 
 
vtls001511047
003
 
 
VRT
005
 
 
20181101125000.0
008
 
 
120904s                 m    00| | eng
039
9
$a 201811011250 $b thirupathi $c 201310031426 $d sinu $c 201307161039 $d prasanna $c 201209041847 $d VLOAD $y 201010121419 $z pjr
082
4
$a PR001.6 $b Sa91S
100
1
$a Saxena, Rajiv
245
1
0
$a Solving bounded diameter minimum spnning tree problem using artificial bee colony algorithm $c by Rajiv Saxena; super vised by Alok Singh
260
$a Hyderabad: $b University of Hyderabad, $c 2009.
300
$a 43p. ; with CD
500
$a Project Report(M.Tech) - Computer Science - Dept. of Computer and Information Science - School of MCIS - University of Hyderabad
650
0
$a COMPUTER SCIENCE - PROJECT REPORT
700
1
$a Singh, Alok; Supervisor
999
$a VIRTUA40
999
$a VTLSSORT0080*0820*1000*2450*2600*3000*5000*6500*7000*9992
No Reviews to Display
Notes
Project Report(M.Tech) - Computer Science - Dept. of Computer and Information Science - School of MCIS - University of Hyderabad
Subject
COMPUTER SCIENCE - PROJECT REPORT