dblp.uni-trier.dewww.dagstuhl.dewww.uni-trier.de

Lih-Hsing Hsu (Selection)

List of publications from the DBLP Bibliography Server - FAQ
Ask others: ACM DL/Guide - CiteSeerX - CSB - MetaPress - Google - Bing - Yahoo

Ask others: ACM DL/Guide - CiteSeerX - CSB - MetaPress - Google - Bing - Yahoo


147Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLLih-Hsing Hsu, Cheng-Kuan Lin, Jimmy J. M. Tan, Chun-Nan Hung: Embedding Cycles into Hypercubes with Prescribe Vertices in the Specific Order. CSE 2011: 351-357
94Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLTung-Yang Ho, Chun-Nan Hung, Lih-Hsing Hsu: On cubic 2-independent Hamiltonian connected graphs. J. Comb. Optim. 14(2-3): 275-294 (2007)
91Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLChao-Ming Sun, Chun-Nan Hung, Hua-Min Huang, Lih-Hsing Hsu, Yue-Dar Jou: Hamiltonian laceability of Faulty Hypercubes. Journal of Interconnection Networks 8(2): 133-145 (2007)
59Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLChun-Nan Hung, Hong-Chun Hsu, Kao-Yung Liang, Lih-Hsing Hsu: Ring embedding in faulty pancake graphs. Inf. Process. Lett. 86(5): 271-275 (2003)
52Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLChun-Nan Hung, Kao-Yung Liang, Lih-Hsing Hsu: Embedding Hamiltonian Paths and Hamiltonian Cycles in Faulty Pancake Graphs. ISPAN 2002: 179-184
48Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLWen-Tzeng Huang, Jimmy J. M. Tan, Chun-Nan Hung, Lih-Hsing Hsu: Fault-Tolerant Hamiltonicity of Twisted Cubes. J. Parallel Distrib. Comput. 62(4): 591-604 (2002)
41Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLChun-Nan Hung, Lih-Hsing Hsu, Ting-Yi Sung: On the construction of combined k-fault-tolerant Hamiltonian graphs. Networks 37(3): 165-170 (2001)
38Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLChun-Nan Hung, Jeng-Jung Wang, Ting-Yi Sung, Lih-Hsing Hsu: On the Isomorphism between Cyclic-Cubes and Wrapped Butterfly Networks. IEEE Trans. Parallel Distrib. Syst. 11(8): 864 (2000)
35Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLJeng-Jung Wang, Chun-Nan Hung, Jimmy J. M. Tan, Lih-Hsing Hsu, Ting-Yi Sung: Construction schemes for fault-tolerant Hamiltonian graphs. Networks 35(3): 233-245 (2000)
34Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLChun-Nan Hung, Lih-Hsing Hsu, Ting-Yi Sung: Christmas Tree: A Versatile 1-Fault-Tolerant Design for Token Rings. Inf. Process. Lett. 72(1-2): 55-63 (1999)
33Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLChang-Hsiung Tsai, Chun-Nan Hung, Lih-Hsing Hsu, Chung-Haw Chang: The correct diameter of trivalent Cayley graphs. Inf. Process. Lett. 72(3-4): 109-111 (1999)
28Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLChun-Nan Hung, Lih-Hsing Hsu, Ting-Yi Sung: Christmas Tree: A 1-Fault-Tolerant Network for Token Rings. ICPADS 1998: 383-
26Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLJeng-Jung Wang, Chun-Nan Hung, Lih-Hsing Hsu: Optimal 1-Hamiltonian Graphs. Inf. Process. Lett. 65(3): 157-161 (1998)
17Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLChun-Nan Hung, Lih-Hsing Hsu, Ting-Yi Sung: A response to Volgenant's Addendum on the most vital edges. Networks 27(4): 255 (1996)
5Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLLih-Hsing Hsu, Rong-Hong Jan, Yu-Che Lee, Chun-Nan Hung, Maw-Sheng Chern: Finding the Most Vital Edge with Respect to Minimum Spanning Tree in Weighted Graphs. Inf. Process. Lett. 39(5): 277-281 (1991)

Selection of 15 from 150 records - Lih-Hsing Hsu has 79 coauthors

Last update 2012-09-10 CET by the DBLP TeamThis material is Open Data Content released under the ODC-BY 1.0 license — See also our legal information page