Please use this identifier to cite or link to this item: http://hdl.handle.net/10263/6963
Full metadata record
DC FieldValueLanguage
dc.contributor.authorKumar, Jammigumpula Ajay-
dc.date.accessioned2018-08-03T05:41:27Z-
dc.date.available2018-08-03T05:41:27Z-
dc.date.issued2018-
dc.identifier.citation38p.en_US
dc.identifier.urihttp://hdl.handle.net/10263/6963-
dc.descriptionDissertation under the supervision of Dr. Sasanka Roy, ACM Uniten_US
dc.language.isoenen_US
dc.publisherIndian Statistical Institute, Kolkataen_US
dc.relation.ispartofseriesDissertation;18-397-
dc.subjectMaximum independent seten_US
dc.subjectGraphsen_US
dc.subjectApproximation algorithmen_US
dc.subjectCollision-freeen_US
dc.subjectCo-comparable graphen_US
dc.titleCollision-free routing problem with restricted L-pathen_US
dc.typeArticleen_US
Appears in Collections:Dissertations - M Tech (CS)

Files in This Item:
File Description SizeFormat 
Diss-397.pdf435.88 kBAdobe PDFView/Open


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