Please use this identifier to cite or link to this item:
http://hdl.handle.net/10263/5760| Title: | Hamiltonian graphs with minimum no of edges for fault-tolerant topologies |
| Authors: | Mukhopadhyaya, Krishnendu Sinha, Bhabani P |
| Keywords: | Distributed system Fault-tolerance Hamiltonian cycle Node failure Link failure |
| Issue Date: | Nov-1992 |
| Citation: | Information Processing Letters, v 44, p 95-99 |
| URI: | http://hdl.handle.net/10263/5760 |
| Appears in Collections: | Computer Science |
Files in This Item:
| File | Description | Size | Format | |
|---|---|---|---|---|
| Hamiltonian graphs with minimum no of edges IPL-1992.pdf | 254.25 kB | Adobe PDF | View/Open |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.