Algorithm to find the opaque minimal forest of a given convex polygon, a new approach by Y.Venkateswara Rao, guided by A.S.Reddy

Venkateswara Rao, Y.
Call Number
PR001.6 V55A
Author
Venkateswara Rao, Y.
Title
Algorithm to find the opaque minimal forest of a given convex polygon, a new approach by Y.Venkateswara Rao, guided by A.S.Reddy
Publication
Hyderabad: University of Hyderabad, 1992
Physical Description
29p.
Series
Computer Science
Added Author
Siva Shankar Reddy, A. guide
Subject
COMPUTER SCIENCE - PROJECT REPORT
Total Ratings: 0
Location Call Number Barcode Item Class Units Copy Number Status  
IGM Library PR001.6 V55A PR1028 Project Reports 1 Non-Circulating
 
 
 
00919nam a2200217 a 4500
001
 
 
vtls000138655
003
 
 
VRT
005
 
 
20130719122700.0
008
 
 
120904s                 m    00| | eng
039
9
$a 201307191227 $b prasanna $c 201307171439 $d prasanna $c 201209041703 $d VLOAD $c 200909301119 $d jayasri $y 200404021243 $z staff
082
0
4
$a PR001.6 $b V55A
100
1
$a Venkateswara Rao, Y.
245
1
0
$a Algorithm to find the opaque minimal forest of a given convex polygon, a new approach $c by Y.Venkateswara Rao, guided by A.S.Reddy
260
$a Hyderabad: $b University of Hyderabad, $c 1992
300
$a 29p.
440
$a Computer Science
502
$a Project Report (M.Tech.)-Computer Science-School of MC&IS, University of Hyderabad, Hyderabad, 1992.
650
0
$a COMPUTER SCIENCE - PROJECT REPORT
700
1
$a Siva Shankar Reddy, A.  guide
999
$a VIRTUA40
999
$a VTLSSORT0080*0820*1000*2450*2600*3000*4400*5020*6500*7000*9992
No Reviews to Display
Subject
COMPUTER SCIENCE - PROJECT REPORT