Hamiltonian graphs with minimum no of edges for fault-tolerant topologies

Simple item page
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

Files

Original bundle

Now showing 1 - 1 of 1
No Thumbnail Available
Name:
Hamiltonian graphs with minimum no of edges IPL-1992.pdf
Size:
254.25 KB
Format:
Adobe Portable Document Format
Download

License bundle

Now showing 1 - 1 of 1
No Thumbnail Available
Name:
license.txt
Size:
1.71 KB
Format:
Item-specific license agreed upon to submission
Description:
Download

Collections

Computer Science