The SCEAS System
Navigation Menu

Search the dblp DataBase


Tung-Yang Ho: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Ting-Yi Sung, Tung-Yang Ho, Lih-Hsing Hsu
    Projective Torus Networks. [Citation Graph (0, 0)][DBLP]
    COCOON, 1997, pp:451-459 [Conf]
  2. Lih-Hsing Hsu, Jeng-Yan Hwang, Tung-Yang Ho, Chang-Hsiung Tsai
    A Linear Time Algorithm to Recognize the Double Euler Trail for Series-Parallel Networks. [Citation Graph (0, 0)][DBLP]
    ISA, 1991, pp:316-325 [Conf]
  3. Tung-Yang Ho, Po-Chun Kuo, Lih-Hsing Hsu
    The Globally Bi-3*-Connected Property of the Brother Trees. [Citation Graph (0, 0)][DBLP]
    JCIS, 2006, pp:- [Conf]
  4. Tung-Yang Ho, Ting-Yi Sung, Lih-Hsing Hsu
    A note on edge fault tolerance with respect to hypercubes. [Citation Graph (0, 0)][DBLP]
    Appl. Math. Lett., 2005, v:18, n:10, pp:1125-1128 [Journal]
  5. Yuan-Hsiang Teng, Jimmy J. M. Tan, Tung-Yang Ho, Lih-Hsing Hsu
    On mutually independent hamiltonian paths. [Citation Graph (0, 0)][DBLP]
    Appl. Math. Lett., 2006, v:19, n:4, pp:345-350 [Journal]
  6. Tung-Yang Ho, Ting-Yi Sung, Lih-Hsing Hsu, Chang-Hsiung Tsai, Jeng-Yan Hwang
    The Recognition of Double Euler Trails in Series-Parallel Networks. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 1998, v:28, n:2, pp:216-257 [Journal]
  7. Ting-Yi Sung, Tung-Yang Ho, Chien-Ping Chang, Lih-Hsing Hsu
    Optimal k-Fault-Tolerant Networks for Token Rings. [Citation Graph (0, 0)][DBLP]
    J. Inf. Sci. Eng., 2000, v:16, n:3, pp:381-390 [Journal]
  8. Tung-Yang Ho, Lih-Hsing Hsu, Ting-Yi Sung
    Transmitting on various network topologies. [Citation Graph (0, 0)][DBLP]
    Networks, 1996, v:27, n:2, pp:145-157 [Journal]
  9. Ting-Yi Sung, Men-Yang Lin, Tung-Yang Ho
    Multiple-Edge-Fault Tolerance with Respect to Hypercubes. [Citation Graph (0, 0)][DBLP]
    IEEE Trans. Parallel Distrib. Syst., 1997, v:8, n:2, pp:187-192 [Journal]
  10. Tung-Yang Ho, Chun-Nan Hung, Lih-Hsing Hsu
    On cubic 2-independent Hamiltonian connected graphs. [Citation Graph (0, 0)][DBLP]
    J. Comb. Optim., 2007, v:14, n:2-3, pp:275-294 [Journal]

  11. Fault-Tolerant Hamiltonicity of the WK-Recursive Networks. [Citation Graph (, )][DBLP]

  12. Mutually orthogonal hamiltonian connected graphs. [Citation Graph (, )][DBLP]

  13. On the extremal number of edges in hamiltonian connected graphs. [Citation Graph (, )][DBLP]

Search in 0.005secs, Finished in 0.005secs
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
System created by [] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002