On the Longest Fault-Free Paths in Hypercubes with More Faulty Nodes

Tz-Liang Kueng, Tyne Liang, Jimmy J. M. Tan, Lih-Hsing Hsu. On the Longest Fault-Free Paths in Hypercubes with More Faulty Nodes. In 9th International Symposium on Parallel Architectures, Algorithms, and Networks, ISPAN 2008, 7-9 May 2008, Sydney, NSW, Australia. pages 71-76, IEEE Computer Society, 2008. [doi]

@inproceedings{KuengLTH08,
  title = {On the Longest Fault-Free Paths in Hypercubes with More Faulty Nodes},
  author = {Tz-Liang Kueng and Tyne Liang and Jimmy J. M. Tan and Lih-Hsing Hsu},
  year = {2008},
  doi = {10.1109/I-SPAN.2008.29},
  url = {http://doi.ieeecomputersociety.org/10.1109/I-SPAN.2008.29},
  researchr = {https://researchr.org/publication/KuengLTH08},
  cites = {0},
  citedby = {0},
  pages = {71-76},
  booktitle = {9th International Symposium on Parallel Architectures, Algorithms, and Networks, ISPAN 2008, 7-9 May 2008, Sydney, NSW, Australia},
  publisher = {IEEE Computer Society},
}