1. DSpace at Indian Statistical Institute
  2. Scientific Contributions of ISI
  3. Computer Science
Please use this identifier to cite or link to this item: http://hdl.handle.net/10263/5760
Full metadata record
DC FieldValueLanguage
dc.contributor.authorMukhopadhyaya, Krishnendu-
dc.contributor.authorSinha, Bhabani P-
dc.date.accessioned2014-01-15T08:06:12Z-
dc.date.available2014-01-15T08:06:12Z-
dc.date.issued1992-11-
dc.identifier.citationInformation Processing Letters, v 44, p 95-99en_US
dc.identifier.urihttp://hdl.handle.net/10263/5760-
dc.language.isoenen_US
dc.subjectDistributed systemen_US
dc.subjectFault-toleranceen_US
dc.subjectHamiltonian cycleen_US
dc.subjectNode failureen_US
dc.subjectLink failureen_US
dc.titleHamiltonian graphs with minimum no of edges for fault-tolerant topologiesen_US
Appears in Collections:Computer Science

Files in This Item:
File Description SizeFormat 
Hamiltonian graphs with minimum no of edges IPL-1992.pdf254.25 kBAdobe PDFView/Open
Show simple item record


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