Please use this identifier to cite or link to this item: http://hdl.handle.net/123456789/6253
Full metadata record
DC FieldValueLanguage
dc.contributor.authorGiri, Pradeep Kumar-
dc.date.accessioned2016-07-01T21:21:44Z-
dc.date.available2016-07-01T21:21:44Z-
dc.date.issued2001-
dc.identifier.citation23p.en_US
dc.identifier.urihttp://hdl.handle.net/123456789/6253-
dc.descriptionDissertation under the supervision of Prof. B.K. Roy, AS Uniten_US
dc.language.isoenen_US
dc.publisherIndian Statistical Institute, Kolkataen_US
dc.relation.ispartofseriesDissertation;2001-81-
dc.subjectAlgorithmsen_US
dc.subjectSubgraph isomorphismen_US
dc.subjectNP completeen_US
dc.titleAlgorithms for finding isomorphic subgraphsen_US
dc.typeThesisen_US
Appears in Collections:Dissertations

Files in This Item:
File Description SizeFormat 
DISS-81.PDFDissertation is the original PDF463.71 kBAdobe PDFView/Open


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