Jinn-Shyong Yang

According to our database¹, Jinn-Shyong Yang authored at least 34 papers between 2004 and 2022.

Collaborative distances:

Dijkstra number² of four.
Erdős number³ of three.

Timeline

Legend:

Book

In proceedings

Article

PhD thesis

Dataset

Other

Links

On csauthors.net:

Bibliography

2022

Configuring Protection Routing via Completely Independent Spanning Trees in Dense Gaussian On-Chip Networks.

[BibT_eX]

[DOI]

IEEE Trans. Netw. Sci. Eng., 2022

Parallel construction of multiple independent spanning trees on highly scalable datacenter networks.

[BibT_eX]

[DOI]

Appl. Math. Comput., 2022

2021

Constructing dual-CISTs of folded divide-and-swap cubes.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2021

2019

The 4-component connectivity of alternating group networks.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2019

2018

The Wide Diameters of Regular Hyper-Stars and Folded Hyper-Stars.

[BibT_eX]

[DOI]

Comput. J., 2018

Two Kinds of Generalized 3-Connectivities of Alternating Group Networks.

[BibT_eX]

[DOI]

Proceedings of the Frontiers in Algorithmics - 12th International Workshop, 2018

2017

Construction independent spanning trees on locally twisted cubes in parallel.

[BibT_eX]

[DOI]

J. Comb. Optim., 2017

Completely Independent Spanning Trees on 4-Regular Chordal Rings.

[BibT_eX]

[DOI]

IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2017

A parallel algorithm for constructing independent spanning trees in twisted cubes.

[BibT_eX]

[DOI]

Jou-Ming Chang

Ting-Jyun Yang

Jinn-Shyong Yang

Discret. Appl. Math., 2017

A Parallel Construction of Vertex-Disjoint Spanning Trees with Optimal Heights in Star Networks.

[BibT_eX]

[DOI]

Proceedings of the Combinatorial Optimization and Applications, 2017

2016

Corrigendum to "Incidence coloring on hypercubes" [Theoret. Comput. Sci. 557 (2014) 59-65].

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2016

Vertex-transitivity on folded crossed cubes.

[BibT_eX]

[DOI]

Kung-Jui Pai

Jou-Ming Chang

Jinn-Shyong Yang

Inf. Process. Lett., 2016

Locally exchanged twisted cubes: Connectivity and super connectivity.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2016

2015

Parallel Construction of Independent Spanning Trees on Enhanced Hypercubes.

[BibT_eX]

[DOI]

IEEE Trans. Parallel Distributed Syst., 2015

A fully parallelized scheme of constructing independent spanning trees on Möbius cubes.

[BibT_eX]

[DOI]

J. Supercomput., 2015

A Note on the Degree Condition of Completely Independent Spanning Trees.

[BibT_eX]

[DOI]

IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2015

Pruning Longer Branches of Independent Spanning Trees on Folded Hyper-Stars.

[BibT_eX]

[DOI]

Jinn-Shyong Yang

Sih-Syuan Luo

Jou-Ming Chang

Comput. J., 2015

A Fast Parallel Algorithm for Constructing Independent Spanning Trees on Parity Cubes.

[BibT_eX]

[DOI]

Appl. Math. Comput., 2015

2014

Incidence coloring on hypercubes.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2014

A comment on "Independent spanning trees in crossed cubes".

[BibT_eX]

[DOI]

Inf. Process. Lett., 2014

Completely Independent Spanning Trees on Some Interconnection Networks.

[BibT_eX]

[DOI]

IEICE Trans. Inf. Syst., 2014

Optimal Independent Spanning Trees on Cartesian Product of Hybrid Graphs.

[BibT_eX]

[DOI]

Jinn-Shyong Yang

Jou-Ming Chang

Comput. J., 2014

Parallel Construction of Independent Spanning Trees on Parity Cubes.

[BibT_eX]

[DOI]

Proceedings of the 17th IEEE International Conference on Computational Science and Engineering, 2014

2011

Broadcasting secure messages via optimal independent spanning trees in folded hypercubes.

[BibT_eX]

[DOI]

Jinn-Shyong Yang

Hung-Chang Chan

Jou-Ming Chang

Discret. Appl. Math., 2011

2010

Independent Spanning Trees on Multidimensional Torus Networks.

[BibT_eX]

[DOI]

IEEE Trans. Computers, 2010

Independent spanning trees on folded hyper-stars.

[BibT_eX]

[DOI]

Jinn-Shyong Yang

Jou-Ming Chang

Networks, 2010

Independent spanning trees vs. edge-disjoint spanning trees in locally twisted cubes.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2010

Constructing Multiple Independent Spanning Trees on Recursive circulant Graphs G(2<sup>M</sup>, 2).

[BibT_eX]

[DOI]

Int. J. Found. Comput. Sci., 2010

2009

On the independent spanning trees of recursive circulant graphs G(cd<sup>m</sup>, d) with d>2.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2009

Independent Spanning Trees on Folded Hypercubes.

[BibT_eX]

[DOI]

Jinn-Shyong Yang

Jou-Ming Chang

Hung Chan

Proceedings of the 10th International Symposium on Pervasive Systems, 2009

2008

Fault-tolerant cycle-embedding in alternating group graphs.

[BibT_eX]

[DOI]

Jou-Ming Chang

Jinn-Shyong Yang

Appl. Math. Comput., 2008

2007

Reducing the Height of Independent Spanning Trees in Chordal Rings.

[BibT_eX]

IEEE Trans. Parallel Distributed Syst., 2007

Parallel construction of optimal independent spanning trees on hypercubes.

[BibT_eX]

[DOI]

Parallel Comput., 2007

2004

Panconnectivity, fault-tolerant hamiltonicity and hamiltonian-connectivity in alternating group graphs.

[BibT_eX]

[DOI]

Networks, 2004

Jinn-Shyong Yang

Timeline

Legend:

Links

On csauthors.net:

Bibliography

Loading...