default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJinn-Shyong Yang
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j31]Mei-Mei Gu
, Jinn-Shyong Yang, Jou-Ming Chang:
Assessing Network Reliability Through Perspectives of Neighbor Connectivity and Subversion. IEEE Trans. Netw. Sci. Eng. 11(5): 4384-4396 (2024)- 2022
- [j30]Jinn-Shyong Yang, Xiao-Yan Li, Sheng-Lung Peng, Jou-Ming Chang:
Parallel construction of multiple independent spanning trees on highly scalable datacenter networks. Appl. Math. Comput. 413: 126617 (2022) - [j29]Kung-Jui Pai, Jinn-Shyong Yang, Guan-Yu Chen, Jou-Ming Chang:
Configuring Protection Routing via Completely Independent Spanning Trees in Dense Gaussian On-Chip Networks. IEEE Trans. Netw. Sci. Eng. 9(2): 932-946 (2022) - 2021
- [j28]Yu-Huei Chang, Kung-Jui Pai, Chiun-Chieh Hsu, Jinn-Shyong Yang, Jou-Ming Chang:
Constructing dual-CISTs of folded divide-and-swap cubes. Theor. Comput. Sci. 856: 75-87 (2021)
2010 – 2019
- 2019
- [j27]Jou-Ming Chang, Kung-Jui Pai, Ro-Yu Wu, Jinn-Shyong Yang:
The 4-component connectivity of alternating group networks. Theor. Comput. Sci. 766: 38-45 (2019) - 2018
- [j26]Jou-Ming Chang, Jinn-Shyong Yang, Shyue-Ming Tang, Kung-Jui Pai:
The Wide Diameters of Regular Hyper-Stars and Folded Hyper-Stars. Comput. J. 61(1): 121-128 (2018) - [c4]Jou-Ming Chang, Kung-Jui Pai, Jinn-Shyong Yang, Ro-Yu Wu:
Two Kinds of Generalized 3-Connectivities of Alternating Group Networks. FAW 2018: 3-14 - [i1]Jou-Ming Chang, Kung-Jui Pai, Ro-Yu Wu, Jinn-Shyong Yang:
The 4-Component Connectivity of Alternating Group Networks. CoRR abs/1808.06160 (2018) - 2017
- [j25]Jou-Ming Chang, Ting-Jyun Yang, Jinn-Shyong Yang:
A parallel algorithm for constructing independent spanning trees in twisted cubes. Discret. Appl. Math. 219: 74-82 (2017) - [j24]Jou-Ming Chang, Hung-Yi Chang, Hung-Lung Wang, Kung-Jui Pai, Jinn-Shyong Yang:
Completely Independent Spanning Trees on 4-Regular Chordal Rings. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 100-A(9): 1932-1935 (2017) - [j23]Yu-Huei Chang, Jinn-Shyong Yang, Sun-Yuan Hsieh, Jou-Ming Chang, Yue-Li Wang:
Construction independent spanning trees on locally twisted cubes in parallel. J. Comb. Optim. 33(3): 956-967 (2017) - [c3]Shih-Shun Kao, Jou-Ming Chang, Kung-Jui Pai, Jinn-Shyong Yang, Shyue-Ming Tang, Ro-Yu Wu:
A Parallel Construction of Vertex-Disjoint Spanning Trees with Optimal Heights in Star Networks. COCOA (1) 2017: 41-55 - 2016
- [j22]Jou-Ming Chang, Xiang-Rui Chen, Jinn-Shyong Yang, Ro-Yu Wu:
Locally exchanged twisted cubes: Connectivity and super connectivity. Inf. Process. Lett. 116(7): 460-466 (2016) - [j21]Kung-Jui Pai, Jou-Ming Chang, Jinn-Shyong Yang:
Vertex-transitivity on folded crossed cubes. Inf. Process. Lett. 116(11): 689-693 (2016) - [j20]Kung-Jui Pai, Jou-Ming Chang, Jinn-Shyong Yang, Ro-Yu Wu:
Corrigendum to "Incidence coloring on hypercubes" [Theoret. Comput. Sci. 557 (2014) 59-65]. Theor. Comput. Sci. 651: 87-88 (2016) - 2015
- [j19]Yu-Huei Chang, Jinn-Shyong Yang, Jou-Ming Chang, Yue-Li Wang:
A Fast Parallel Algorithm for Constructing Independent Spanning Trees on Parity Cubes. Appl. Math. Comput. 268: 489-495 (2015) - [j18]Jinn-Shyong Yang, Sih-Syuan Luo, Jou-Ming Chang:
Pruning Longer Branches of Independent Spanning Trees on Folded Hyper-Stars. Comput. J. 58(11): 2972-2981 (2015) - [j17]Hung-Yi Chang, Hung-Lung Wang, Jinn-Shyong Yang, Jou-Ming Chang:
A Note on the Degree Condition of Completely Independent Spanning Trees. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 98-A(10): 2191-2193 (2015) - [j16]Jinn-Shyong Yang, Meng-Ru Wu, Jou-Ming Chang, Yu-Huei Chang:
A fully parallelized scheme of constructing independent spanning trees on Möbius cubes. J. Supercomput. 71(3): 952-965 (2015) - [j15]Jinn-Shyong Yang, Jou-Ming Chang, Kung-Jui Pai, Hung-Chang Chan:
Parallel Construction of Independent Spanning Trees on Enhanced Hypercubes. IEEE Trans. Parallel Distributed Syst. 26(11): 3090-3098 (2015) - 2014
- [j14]Jinn-Shyong Yang, Jou-Ming Chang:
Optimal Independent Spanning Trees on Cartesian Product of Hybrid Graphs. Comput. J. 57(1): 93-99 (2014) - [j13]Kung-Jui Pai, Jinn-Shyong Yang, Sing-Chen Yao, Shyue-Ming Tang, Jou-Ming Chang:
Completely Independent Spanning Trees on Some Interconnection Networks. IEICE Trans. Inf. Syst. 97-D(9): 2514-2517 (2014) - [j12]Jou-Ming Chang, Jhen-Ding Wang, Jinn-Shyong Yang, Kung-Jui Pai:
A comment on "Independent spanning trees in crossed cubes". Inf. Process. Lett. 114(12): 734-739 (2014) - [j11]Kung-Jui Pai, Jou-Ming Chang, Jinn-Shyong Yang, Ro-Yu Wu:
Incidence coloring on hypercubes. Theor. Comput. Sci. 557: 59-65 (2014) - [c2]Yu-Huei Chang, Jinn-Shyong Yang, Jou-Ming Chang, Yue-Li Wang:
Parallel Construction of Independent Spanning Trees on Parity Cubes. CSE 2014: 1150-1154 - 2011
- [j10]Jinn-Shyong Yang, Hung-Chang Chan, Jou-Ming Chang:
Broadcasting secure messages via optimal independent spanning trees in folded hypercubes. Discret. Appl. Math. 159(12): 1254-1263 (2011) - 2010
- [j9]Jinn-Shyong Yang, Jou-Ming Chang, Shyue-Ming Tang, Yue-Li Wang:
Constructing Multiple Independent Spanning Trees on Recursive circulant Graphs G(2M, 2). Int. J. Found. Comput. Sci. 21(1): 73-90 (2010) - [j8]Jia-Cian Lin, Jinn-Shyong Yang, Chiun-Chieh Hsu, Jou-Ming Chang:
Independent spanning trees vs. edge-disjoint spanning trees in locally twisted cubes. Inf. Process. Lett. 110(10): 414-419 (2010) - [j7]Jinn-Shyong Yang, Jou-Ming Chang:
Independent spanning trees on folded hyper-stars. Networks 56(4): 272-281 (2010) - [j6]Shyue-Ming Tang, Jinn-Shyong Yang, Yue-Li Wang, Jou-Ming Chang:
Independent Spanning Trees on Multidimensional Torus Networks. IEEE Trans. Computers 59(1): 93-102 (2010)
2000 – 2009
- 2009
- [j5]Jinn-Shyong Yang, Jou-Ming Chang, Shyue-Ming Tang, Yue-Li Wang:
On the independent spanning trees of recursive circulant graphs G(cdm, d) with d>2. Theor. Comput. Sci. 410(21-23): 2001-2010 (2009) - [c1]Jinn-Shyong Yang, Jou-Ming Chang, Hung Chan:
Independent Spanning Trees on Folded Hypercubes. ISPAN 2009: 601-605 - 2008
- [j4]Jou-Ming Chang, Jinn-Shyong Yang:
Fault-tolerant cycle-embedding in alternating group graphs. Appl. Math. Comput. 197(2): 760-767 (2008) - 2007
- [j3]Jinn-Shyong Yang, Shyue-Ming Tang, Jou-Ming Chang, Yue-Li Wang:
Parallel construction of optimal independent spanning trees on hypercubes. Parallel Comput. 33(1): 73-79 (2007) - [j2]Jinn-Shyong Yang, Jou-Ming Chang, Shyue-Ming Tang, Yue-Li Wang:
Reducing the Height of Independent Spanning Trees in Chordal Rings. IEEE Trans. Parallel Distributed Syst. 18(5): 644-657 (2007) - 2004
- [j1]Jou-Ming Chang, Jinn-Shyong Yang, Yue-Li Wang, Yuwen Cheng:
Panconnectivity, fault-tolerant hamiltonicity and hamiltonian-connectivity in alternating group graphs. Networks 44(4): 302-310 (2004)
Coauthor Index
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 2025-01-21 00:01 CET 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:
