Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDTing-Yi Sung
- > Home > Persons > Ting-Yi Sung
Publications
- 2005
[j22]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)- 2001
- [j20]Tseng-Kuei Li, Jimmy J. M. Tan, Lih-Hsing Hsu, Ting-Yi Sung:
The shuffle-cubes and their generalization. Inf. Process. Lett. 77(1): 35-41 (2001) - [j19]Jeng-Jung Wang, Ting-Yi Sung, Lih-Hsing Hsu:
A Family of Trivalent 1-Hamiltonia Graphs With Diameter O(log n). J. Inf. Sci. Eng. 17(4): 535-548 (2001) - [j18]Chun-Nan Hung, Lih-Hsing Hsu, Ting-Yi Sung:
On the construction of combined k-fault-tolerant Hamiltonian graphs. Networks 37(3): 165-170 (2001) - 2000
- [j17]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) - [j16]Tseng-Kuei Li, Jimmy J. M. Tan, Lih-Hsing Hsu, Ting-Yi Sung:
Optimum Congested Routing Strategy on Twisted Cubes. J. Interconnect. Networks 1(2): 115-134 (2000) - [j15]Jeng-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) - [j14]Chien-Ping Chang, Ting-Yi Sung, Lih-Hsing Hsu:
Edge Congestion and Topological Properties of Crossed Cubes. IEEE Trans. Parallel Distributed Syst. 11(1): 64-80 (2000) - [j13]Chun-Nan Hung, Jeng-Jung Wang, Ting-Yi Sung, Lih-Hsing Hsu:
On the Isomorphism between Cyclic-Cubes and Wrapped Butterfly Networks. IEEE Trans. Parallel Distributed Syst. 11(8): 864 (2000) - 1999
- [j12]Chun-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) - 1998
- [j11]Ting-Yi Sung, Chun-Yuan Lin, Yen-Chu Chuang, Lih-Hsing Hsu:
Fault Tolerant Token Ring Embedding in Double Loop Networks. Inf. Process. Lett. 66(4): 201-207 (1998) - [j10]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) - [c6]Jeng-Jung Wang, Ting-Yi Sung, Lih-Hsing Hsu, Men-Yang Lin:
A New Family of Optimal 1-Hamiltonian Graphs with Small Diameter. COCOON 1998: 269-278 - [c5]Chun-Nan Hung, Lih-Hsing Hsu, Ting-Yi Sung:
Christmas Tree: A 1-Fault-Tolerant Network for Token Rings. ICPADS 1998: 383- - 1997
- [j8]Shih-Yih Wang, Lih-Hsing Hsu, Ting-Yi Sung:
Faithful 1-Edge Fault Tolerant Graphs. Inf. Process. Lett. 61(4): 173-181 (1997) - [j7]Jeng-Jung Wang, Shih-Yih Wang, Lih-Hsing Hsu, Ting-Yi Sung:
Extended Tree Contraction for Some parallel Algorithms on Series-Parallel Networks. J. Inf. Sci. Eng. 13(4): 665-680 (1997) - [c4]Ting-Yi Sung, Tung-Yang Ho, Lih-Hsing Hsu:
Projective Torus Networks. COCOON 1997: 451-459 - [c3]Chien-Ping Chang, Ting-Yi Sung, Lih-Hsing Hsu:
A new shortest path routing algorithm and embedding cycles of crossed cube. ISPAN 1997: 125-131 - 1996
- [j5]Tung-Yang Ho, Lih-Hsing Hsu, Ting-Yi Sung:
Transmitting on various network topologies. Networks 27(2): 145-157 (1996) - [j4]Chun-Nan Hung, Lih-Hsing Hsu, Ting-Yi Sung:
A response to Volgenant's Addendum on the most vital edges. Networks 27(4): 255 (1996) - 1993
- [j2]Chun-Nan Hung, Lih-Hsing Hsu, Ting-Yi Sung:
The most vital edges of matching in a bipartite graph. Networks 23(4): 309-313 (1993) - 1992
- [c2]Ting-Yi Sung, Lih-Hsing Hsu, Jeng-Yan Hwang:
Data Structure for Graph Representations of a Network Having Double Euler Trails. IFIP Congress (1) 1992: 436-442
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-21 18:09 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
