Please use this identifier to cite or link to this item: http://hdl.handle.net/10263/6271
Full metadata record
DC FieldValueLanguage
dc.contributor.authorDas, Gautam Kumar-
dc.date.accessioned2016-07-04T17:24:35Z-
dc.date.available2016-07-04T17:24:35Z-
dc.date.issued2002-
dc.identifier.citation34p.en_US
dc.identifier.urihttp://hdl.handle.net/10263/6271-
dc.descriptionDissertation under the supervision of Dr. S. Sur-Koley and Dr. S.C Nandy, ACM Uniten_US
dc.language.isoenen_US
dc.publisherIndian Statistical Institute, Kolkataen_US
dc.relation.ispartofseriesDissertation;2002-99-
dc.subjectAlgorithmsen_US
dc.subjectRectilinear polygonen_US
dc.subjectNoncrossing pathsen_US
dc.titleThe smallest pair of noncrossing paths in a rectilinear polygonen_US
dc.typeThesisen_US
Appears in Collections:Dissertations - M Tech (CS)

Files in This Item:
File Description SizeFormat 
DISS-99.PDFDissertation is the original PDF593.61 kBAdobe PDFView/Open


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.