![](https://dblp1.uni-trier.de/img/logo.ua.320x120.png)
![](https://dblp1.uni-trier.de/img/dropdown.dark.16x16.png)
![](https://dblp1.uni-trier.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp1.uni-trier.de/img/search.dark.16x16.png)
![search dblp](https://dblp1.uni-trier.de/img/search.dark.16x16.png)
default search action
Tung-Yang Ho
Person information
Refine list
![note](https://dblp1.uni-trier.de/img/note-mark.dark.12x12.png)
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2014
- [j22]Lih-Hsing Hsu, Tung-Yang Ho, Yen-Hsun Ho, Chey-Woei Tsay:
Cycles in cube-connected cycles graphs. Discret. Appl. Math. 167: 163-171 (2014) - [j21]Tung-Yang Ho, Cheng-Kuan Lin, Jimmy J. M. Tan, Lih-Hsing Hsu:
Fault-tolerant hamiltonian connectivity of the WK-recursive networks. Inf. Sci. 271: 236-245 (2014) - 2013
- [j20]Jeng-Jung Wang, Tung-Yang Ho, Ting-Yi Sung, Ming-Yi Ju:
Changing the Diameter in a Diagonal Mesh Network. J. Inf. Sci. Eng. 29(2): 193-208 (2013) - 2012
- [j19]Cheng-Kuan Lin, Tung-Yang Ho, Jimmy J. M. Tan, Lih-Hsing Hsu:
Super Spanning Connectivity of Augmented Cubes. Ars Comb. 104: 161-177 (2012) - [j18]Lih-Hsing Hsu, Eddie Cheng
, László Lipták, Jimmy J. M. Tan, Cheng-Kuan Lin, Tung-Yang Ho:
Component connectivity of the hypercubes. Int. J. Comput. Math. 89(2): 137-145 (2012) - 2011
- [j17]Tung-Yang Ho, Cheng-Kuan Lin, Jimmy J. M. Tan, D. Frank Hsu, Lih-Hsing Hsu:
On the Extremal Number of Edges in Hamiltonian Graphs. J. Inf. Sci. Eng. 27(5): 1659-1665 (2011) - 2010
- [j16]Tung-Yang Ho, Cheng-Kuan Lin, Jimmy J. M. Tan, D. Frank Hsu, Lih-Hsing Hsu:
On the extremal number of edges in hamiltonian connected graphs. Appl. Math. Lett. 23(1): 26-29 (2010)
2000 – 2009
- 2009
- [j15]Tung-Yang Ho, Cheng-Kuan Lin, Jimmy J. M. Tan, Lih-Hsing Hsu:
Mutually orthogonal hamiltonian connected graphs. Appl. Math. Lett. 22(9): 1429-1431 (2009) - [j14]Cheng-Kuan Lin, Tung-Yang Ho, Jimmy J. M. Tan, Lih-Hsing Hsu:
Fault-tolerant hamiltonicity and fault-tolerant hamiltonian connectivity of the folded Petersen cube networks. Int. J. Comput. Math. 86(1): 57-66 (2009) - [j13]Tung-Yang Ho, Yuan-Kang Shih, Jimmy J. M. Tan, Lih-Hsing Hsu:
Conditional fault hamiltonian connectivity of the complete graph. Inf. Process. Lett. 109(12): 585-588 (2009) - [j12]Tung-Yang Ho, Cheng-Kuan Lin:
Fault-Tolerant Hamiltonian Connectivity and Fault-Tolerant Hamiltonicity of the Fully Connected Cubic Networks. J. Inf. Sci. Eng. 25(6): 1855-1862 (2009) - [j11]Cheng-Kuan Lin, Chien-Ping Chang, Tung-Yang Ho, Jimmy J. M. Tan, Lih-Hsing Hsu:
A New Isomorphic Definition of the Crossed Cube and its Spanning Connectivity. J. Interconnect. Networks 10(1-2): 149-166 (2009) - [j10]Cheng-Kuan Lin, Tung-Yang Ho, Jimmy J. M. Tan, Lih-Hsing Hsu:
Fault-Tolerant Hamiltonian laceability and Fault-Tolerant Conditional Hamiltonian for Bipartite Hypercube-like Networks. J. Interconnect. Networks 10(3): 243-251 (2009) - [c4]Tung-Yang Ho, Cheng-Kuan Lin, Jimmy J. M. Tan, Lih-Hsing Hsu:
Fault-Tolerant Hamiltonicity of the WK-Recursive Networks. ISPAN 2009: 592-595 - 2008
- [j9]Jeng-Jung Wang, Tung-Yang Ho, Daniela Ferrero
, Ting-Yi Sung:
Diameter variability of cycles and tori. Inf. Sci. 178(14): 2960-2967 (2008) - 2007
- [j8]Tung-Yang Ho, Chun-Nan Hung, Lih-Hsing Hsu:
On cubic 2-independent Hamiltonian connected graphs. J. Comb. Optim. 14(2-3): 275-294 (2007) - 2006
- [j7]Yuan-Hsiang Teng, Jimmy J. M. Tan, Tung-Yang Ho, Lih-Hsing Hsu:
On mutually independent hamiltonian paths. Appl. Math. Lett. 19(4): 345-350 (2006) - [c3]Tung-Yang Ho, Po-Chun Kuo
, Lih-Hsing Hsu:
The Globally Bi-3*-Connected Property of the Brother Trees. JCIS 2006 - 2005
- [j6]Tung-Yang Ho, Ting-Yi Sung, Lih-Hsing Hsu:
A note on edge fault tolerance with respect to hypercubes. Appl. Math. Lett. 18(10): 1125-1128 (2005) - 2000
- [j5]Ting-Yi Sung, Tung-Yang Ho, Chien-Ping Chang, Lih-Hsing Hsu:
Optimal k-Fault-Tolerant Networks for Token Rings. J. Inf. Sci. Eng. 16(3): 381-390 (2000)
1990 – 1999
- 1998
- [j4]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. J. Algorithms 28(2): 216-257 (1998) - 1997
- [j3]Ting-Yi Sung, Men-Yang Lin, Tung-Yang Ho:
Multiple-Edge-Fault Tolerance with Respect to Hypercubes. IEEE Trans. Parallel Distributed Syst. 8(2): 187-192 (1997) - [c2]Ting-Yi Sung, Tung-Yang Ho, Lih-Hsing Hsu:
Projective Torus Networks. COCOON 1997: 451-459 - 1996
- [j2]Tung-Yang Ho, Lih-Hsing Hsu, Ting-Yi Sung:
Transmitting on various network topologies. Networks 27(2): 145-157 (1996) - 1994
- [j1]Tung-Yang Ho, Lih-Hsing Hsu:
A note on the minimum cut cover of graphs. Oper. Res. Lett. 15(4): 193-194 (1994) - 1991
- [c1]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. ISA 1991: 316-325
Coauthor Index
aka: Jimmy J. M. Tan
![](https://dblp1.uni-trier.de/img/cog.dark.24x24.png)
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-24 23:06 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint