Jou-Ming Chang
Orcid: 0000-0002-9542-7968
According to our database1,
Jou-Ming Chang
authored at least 135 papers
between 1997 and 2024.
Collaborative distances:
Collaborative distances:
Timeline
Legend:
Book In proceedings Article PhD thesis Dataset OtherLinks
Online presence:
-
on orcid.org
On csauthors.net:
Bibliography
2024
J. Supercomput., July, 2024
Determining the 2-Tuple Total Domination Number of a Harary Graph under Specific Degree Conditions.
J. Inf. Sci. Eng., March, 2024
Paired 2-disjoint path covers of k-ary n-cubes under the partitioned edge fault model.
J. Parallel Distributed Comput., 2024
Discret. Appl. Math., 2024
Appl. Math. Comput., 2024
2023
Embedding Hamiltonian Paths in $k$-Ary $n$-Cubes With Exponentially-Many Faulty Edges.
IEEE Trans. Computers, November, 2023
Theor. Comput. Sci., October, 2023
Connectivity, super connectivity and generalized 3-connectivity of folded divide-and-swap cubes.
Inf. Process. Lett., August, 2023
Constructing Multiple CISTs on BCube-Based Data Center Networks in the Occurrence of Switch Failures.
IEEE Trans. Computers, July, 2023
An Efficient Algorithm for Hamiltonian Path Embedding of $k$k-Ary $n$n-Cubes Under the Partitioned Edge Fault Model.
IEEE Trans. Parallel Distributed Syst., June, 2023
Three edge-disjoint Hamiltonian cycles in crossed cubes with applications to fault-tolerant data broadcasting.
J. Supercomput., March, 2023
J. Parallel Distributed Comput., January, 2023
Reliability assessment of the divide-and-swap cube in terms of generalized connectivity.
Theor. Comput. Sci., 2023
Discret. Appl. Math., 2023
2022
Completely Independent Spanning Trees on BCCC Data Center Networks With an Application to Fault-Tolerant Routing.
IEEE Trans. Parallel Distributed Syst., 2022
Transmission Failure Analysis of Multi-Protection Routing in Data Center Networks With Heterogeneous Edge-Core Servers.
IEEE/ACM Trans. Netw., 2022
Configuring Protection Routing via Completely Independent Spanning Trees in Dense Gaussian On-Chip Networks.
IEEE Trans. Netw. Sci. Eng., 2022
A secure data transmission scheme based on multi-protection routing in datacenter networks.
J. Parallel Distributed Comput., 2022
J. Comb. Optim., 2022
Parallel construction of multiple independent spanning trees on highly scalable datacenter networks.
Appl. Math. Comput., 2022
Generating Spanning-Tree Sequences of a Fan Graph in Lexicographic Order and Ranking/Unranking Algorithms.
Proceedings of the Combinatorial Optimization - 7th International Symposium, 2022
2021
Constructing dual-CISTs of pancake graphs and performance assessment of protection routings on some Cayley networks.
J. Supercomput., 2021
Constructing dual-CISTs with short diameters using a generic adjustment scheme on bicubes.
Theor. Comput. Sci., 2021
Optim. Lett., 2021
Packing internally disjoint Steiner trees to compute the <i>κ</i><sub>3</sub>-connectivity in augmented cubes.
J. Parallel Distributed Comput., 2021
The reliability analysis based on the generalized connectivity in balanced hypercubes.
Discret. Appl. Math., 2021
IEEE Access, 2021
2020
IEEE Trans. Parallel Distributed Syst., 2020
Relationship between extra edge connectivity and component edge connectivity for regular graphs.
Theor. Comput. Sci., 2020
J. Parallel Distributed Comput., 2020
Three completely independent spanning trees of crossed cubes with application to secure-protection routing.
Inf. Sci., 2020
Inf. Process. Lett., 2020
Int. J. Found. Comput. Sci., 2020
Discret. Appl. Math., 2020
Comments on "A Hamilton sufficient condition for completely independent spanning tree".
Discret. Appl. Math., 2020
Analysis on component connectivity of bubble-sort star graphs and burnt pancake graphs.
Discret. Appl. Math., 2020
Comput. J., 2020
Appl. Math. Comput., 2020
A Parallel Algorithm for Constructing Two Edge-disjoint Hamiltonian Cycles in Locally Twisted Cubes.
Proceedings of the International Computer Symposium, 2020
2019
IEEE/ACM Trans. Netw., 2019
A two-stages tree-searching algorithm for finding three completely independent spanning trees.
Theor. Comput. Sci., 2019
Theor. Comput. Sci., 2019
Amortized efficiency of constructing multiple independent spanning trees on bubble-sort networks.
J. Comb. Optim., 2019
Improving the diameters of completely independent spanning trees in locally twisted cubes.
Inf. Process. Lett., 2019
IEICE Trans. Inf. Syst., 2019
Amortized efficiency of generation, ranking and unranking left-child sequences in lexicographic order.
Discret. Appl. Math., 2019
Measuring the Vulnerability of Alternating Group Graphs and Split-Star Networks in Terms of Component Connectivity.
IEEE Access, 2019
Proceedings of the Frontiers in Algorithmics - 13th International Workshop, 2019
Proceedings of the Algorithmic Aspects in Information and Management, 2019
2018
Realizing Exchanged Crossed Cube Communication Patterns on Linear Array WDM Optical Networks.
Int. J. Found. Comput. Sci., 2018
IEICE Trans. Inf. Syst., 2018
Proceedings of the Frontiers in Algorithmics - 12th International Workshop, 2018
Proceedings of the Computing and Combinatorics - 24th International Conference, 2018
2017
J. Comb. Optim., 2017
IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2017
Discret. Appl. Math., 2017
A Constant Amortized Time Algorithm for Generating Left-Child Sequences in Lexicographic Order.
Proceedings of the Frontiers in Algorithmics - 11th International Workshop, 2017
A Parallel Construction of Vertex-Disjoint Spanning Trees with Optimal Heights in Star Networks.
Proceedings of the Combinatorial Optimization and Applications, 2017
2016
Corrigendum to "Incidence coloring on hypercubes" [Theoret. Comput. Sci. 557 (2014) 59-65].
Theor. Comput. Sci., 2016
Constructing two completely independent spanning trees in hypercube-variant networks.
Theor. Comput. Sci., 2016
Inf. Process. Lett., 2016
IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2016
Amortized Efficiency of Ranking and Unranking Left-Child Sequences in Lexicographic Order.
Proceedings of the Combinatorial Optimization and Applications, 2016
2015
IEEE Trans. Parallel Distributed Syst., 2015
A fully parallelized scheme of constructing independent spanning trees on Möbius cubes.
J. Supercomput., 2015
IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2015
IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2015
Comput. J., 2015
A Fast Parallel Algorithm for Constructing Independent Spanning Trees on Parity Cubes.
Appl. Math. Comput., 2015
Proceedings of the 2015 IEEE International Conference on Smart City/SocialCom/SustainCom/DataCom/SC2 2015, 2015
Proceedings of the Combinatorial Algorithms - 26th International Workshop, 2015
2014
Theor. Comput. Sci., 2014
Inf. Process. Lett., 2014
IEICE Trans. Inf. Syst., 2014
IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2014
IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2014
Comput. J., 2014
Proceedings of the Intelligent Systems and Applications, 2014
Proceedings of the 17th IEEE International Conference on Computational Science and Engineering, 2014
2013
IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2013
2011
Theor. Comput. Sci., 2011
Math. Comput. Model., 2011
IEICE Trans. Inf. Syst., 2011
Broadcasting secure messages via optimal independent spanning trees in folded hypercubes.
Discret. Appl. Math., 2011
Algorithmica, 2011
2010
IEEE Trans. Computers, 2010
Independent spanning trees vs. edge-disjoint spanning trees in locally twisted cubes.
Inf. Process. Lett., 2010
Constructing Multiple Independent Spanning Trees on Recursive circulant Graphs G(2<sup>M</sup>, 2).
Int. J. Found. Comput. Sci., 2010
Erratum to "A new upper bound on the queuenumber of hypercubes" [Discrete Mathematics 310 (2010) 935-939].
Discret. Math., 2010
Discret. Appl. Math., 2010
Comput. J., 2010
2009
On the independent spanning trees of recursive circulant graphs G(cd<sup>m</sup>, d) with d>2.
Theor. Comput. Sci., 2009
Inf. Process. Lett., 2009
The Interchange Graphs of Tournaments with Minimum Score Vectors Are Exactly Hypercubes.
Graphs Comb., 2009
Appl. Math. Comput., 2009
Proceedings of the 10th International Symposium on Pervasive Systems, 2009
Proceedings of the 9th International Conference on Hybrid Intelligent Systems (HIS 2009), 2009
2008
Inf. Process. Lett., 2008
Appl. Math. Comput., 2008
2007
Reducing the Height of Independent Spanning Trees in Chordal Rings.
IEEE Trans. Parallel Distributed Syst., 2007
Parallel Comput., 2007
2006
A linear time algorithm for binary tree sequences transformation using left-arm and right-arm rotations.
Theor. Comput. Sci., 2006
Eur. J. Oper. Res., 2006
A Sufficient Condition for Quasi-Claw-Free Hamiltonian Graphs.
Ars Comb., 2006
2005
Int. J. Comput. Math., 2005
Int. J. Comput. Math., 2005
2004
Panconnectivity, fault-tolerant hamiltonicity and hamiltonian-connectivity in alternating group graphs.
Networks, 2004
2003
Distributed algorithms for finding the unique minimum distance dominating set in directed split-stars.
J. Parallel Distributed Comput., 2003
Powers of Asteroidal Triple-free Graphs with Applications.
Ars Comb., 2003
2000
1999
Inf. Process. Lett., 1999
Proceedings of the Algorithms and Computation, 10th International Symposium, 1999
1998
1997
Inf. Sci., 1997