DSpace Repository

Collision-free routing problem with restricted L-path

Show simple item record

dc.contributor.author Kumar, Jammigumpula Ajay
dc.date.accessioned 2018-08-03T05:41:27Z
dc.date.available 2018-08-03T05:41:27Z
dc.date.issued 2018
dc.identifier.citation 38p. en_US
dc.identifier.uri http://hdl.handle.net/10263/6963
dc.description Dissertation under the supervision of Dr. Sasanka Roy, ACM Unit en_US
dc.language.iso en en_US
dc.publisher Indian Statistical Institute, Kolkata en_US
dc.relation.ispartofseries Dissertation;18-397
dc.subject Maximum independent set en_US
dc.subject Graphs en_US
dc.subject Approximation algorithm en_US
dc.subject Collision-free en_US
dc.subject Co-comparable graph en_US
dc.title Collision-free routing problem with restricted L-path en_US
dc.type Article en_US


Files in this item

This item appears in the following Collection(s)

Show simple item record

Search DSpace


Advanced Search

Browse

My Account