Jou-Ming Chang

ORCID

Publication Activity (10 Years)

Years Active: 1997-2024
Publications (10 Years): 81

Top Venues

Theor. Comput. Sci.

Discret. Appl. Math.

Inf. Process. Lett.

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

Publications

Huimei Guo, Rong-Xia Hao, Jou-Ming Chang, Young Soo Kwon
Hyper star structure connectivity of hierarchical folded cubic networks. J. Supercomput. 80 (10) (2024)
Rong-Xia Hao, Xiao-Wen Qin, Hui Zhang, Jou-Ming Chang
Two-disjoint-cycle-cover pancyclicity of data center networks. Appl. Math. Comput. 475 (2024)
Hongbin Zhuang, Xiao-Yan Li, Jou-Ming Chang, Ximeng Liu
Paired 2-disjoint path covers of k-ary n-cubes under the partitioned edge fault model. J. Parallel Distributed Comput. 190 (2024)
Shu-Li Zhao, Hengzhe Li, Jou-Ming Chang
On the minimum size of graphs with given generalized connectivity. Discret. Appl. Math. 355 (2024)
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) (2024)
Min-Shu Jao, Hung-Lung Wang, Jou-Ming Chang, Chia-Wen Wu
Determining the 2-Tuple Total Domination Number of a Harary Graph under Specific Degree Conditions. J. Inf. Sci. Eng. 40 (2) (2024)
Hongbin Zhuang, Xiao-Yan Li, Jou-Ming Chang, Dajin Wang
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. 34 (6) (2023)
Shu-Li Zhao, Jou-Ming Chang, Heng-Zhe Li
The generalized 4-connectivity of pancake graphs. Discret. Appl. Math. 327 (2023)
Hongbin Zhuang, Xiao-Yan Li, Jou-Ming Chang, Cheng-Kuan Lin, Ximeng Liu
Embedding Hamiltonian Paths in $k$-Ary $n$-Cubes With Exponentially-Many Faulty Edges. IEEE Trans. Computers 72 (11) (2023)
Shu-Li Zhao, Jou-Ming Chang
Reliability assessment of the divide-and-swap cube in terms of generalized connectivity. Theor. Comput. Sci. 943 (2023)
Wanling Lin, Xiao-Yan Li, Jou-Ming Chang, Xiaohua Jia
Constructing Multiple CISTs on BCube-Based Data Center Networks in the Occurrence of Switch Failures. IEEE Trans. Computers 72 (7) (2023)
Mei-Mei Gu, Jou-Ming Chang
Neighbor connectivity of pancake graphs and burnt pancake graphs. Discret. Appl. Math. 324 (2023)
Mei-Mei Gu, Kung-Jui Pai, Jou-Ming Chang
Subversion analyses of hierarchical networks based on (edge) neighbor connectivity. J. Parallel Distributed Comput. 171 (2023)
Shu-Li Zhao, Jou-Ming Chang
Connectivity, super connectivity and generalized 3-connectivity of folded divide-and-swap cubes. Inf. Process. Lett. 182 (2023)
Kung-Jui Pai, Ro-Yu Wu, Sheng-Lung Peng, Jou-Ming Chang
Three edge-disjoint Hamiltonian cycles in crossed cubes with applications to fault-tolerant data broadcasting. J. Supercomput. 79 (4) (2023)
Hongbin Zhuang, Wanling Lin, Xiao-Yan Li, Jou-Ming Chang
Matroidal connectivity and conditional matroidal connectivity of star graphs. Theor. Comput. Sci. 977 (2023)
Xiao-Yan Li, Wanling Lin, Ximeng Liu, Cheng-Kuan Lin, Kung-Jui Pai, Jou-Ming Chang
Completely Independent Spanning Trees on BCCC Data Center Networks With an Application to Fault-Tolerant Routing. IEEE Trans. Parallel Distributed Syst. 33 (8) (2022)
Xiao-Yan Li, Wanling Lin, Jou-Ming Chang, Xiaohua Jia
Transmission Failure Analysis of Multi-Protection Routing in Data Center Networks With Heterogeneous Edge-Core Servers. IEEE/ACM Trans. Netw. 30 (4) (2022)
Xiao-Yan Li, Wanling Lin, Wenzhong Guo, Jou-Ming Chang
A secure data transmission scheme based on multi-protection routing in datacenter networks. J. Parallel Distributed Comput. 167 (2022)
Yu-Han Chen, Kung-Jui Pai, Hsin-Jung Lin, Jou-Ming Chang
Constructing tri-CISTs in shuffle-cubes. J. Comb. Optim. 44 (5) (2022)
Yu-Hsuan Chang, Ro-Yu Wu, Ruay-Shiung Chang, Jou-Ming Chang
Improved algorithms for ranking and unranking (k, m)-ary trees in B-order. J. Comb. Optim. 44 (3) (2022)
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) (2022)
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 (2022)
Ro-Yu Wu, Cheng-Chia Tseng, Ling-Ju Hung, Jou-Ming Chang
Generating Spanning-Tree Sequences of a Fan Graph in Lexicographic Order and Ranking/Unranking Algorithms. ISCO (2022)
Yi-Cheng Yang, Shih-Shun Kao, Ralf Klasing, Sun-Yuan Hsieh, Hsin-Hung Chou, Jou-Ming Chang
The Construction of Multiple Independent Spanning Trees on Burnt Pancake Networks. IEEE Access 9 (2021)
Kung-Jui Pai, Ruay-Shiung Chang, Jou-Ming Chang
Constructing dual-CISTs of pancake graphs and performance assessment of protection routings on some Cayley networks. J. Supercomput. 77 (1) (2021)
Mei-Mei Gu, Jou-Ming Chang, Rong-Xia Hao
Strong Menger Connectedness of Augmented k-ary n-cubes. Comput. J. 64 (5) (2021)
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 (2021)
Chao Wei, Rong-Xia Hao, Jou-Ming Chang
-connectivity in augmented cubes. J. Parallel Distributed Comput. 154 (2021)
Mei-Mei Gu, Rong-Xia Hao, Jou-Ming Chang
Reliability Analysis of Alternating Group Graphs and Split-Stars. Comput. J. 64 (9) (2021)
Mei-Mei Gu, Jou-Ming Chang
A Note on Super Connectivity of the Bouwer Graph. J. Interconnect. Networks 21 (4) (2021)
Xiao-Yan Li, Wanling Lin, Jou-Ming Chang, Xiaohua Jia
Transmission Failure Analysis of Multi-Protection Routing in Data Center Networks with Heterogeneous Edge-Core Servers. CoRR (2021)
Yu-Han Chen, Kung-Jui Pai, Hsin-Jung Lin, Jou-Ming Chang
Constructing Tri-CISTs in Shuffle-Cubes. COCOON (2021)
Yu-Hsuan Chang, Ro-Yu Wu, Cheng-Kuan Lin, Jou-Ming Chang
A loopless algorithm for generating (k, m)-ary trees in Gray code order. Optim. Lett. 15 (4) (2021)
Chao Wei, Rong-Xia Hao, Jou-Ming Chang
The reliability analysis based on the generalized connectivity in balanced hypercubes. Discret. Appl. Math. 292 (2021)
Yu-Han Chen, Shyue-Ming Tang, Kung-Jui Pai, Jou-Ming Chang
Constructing dual-CISTs with short diameters using a generic adjustment scheme on bicubes. Theor. Comput. Sci. (2021)
Kung-Jui Pai, Ro-Yu Wu, Sheng-Lung Peng, Jou-Ming Chang
Three Edge-Disjoint Hamiltonian Cycles in Crossed Cubes with Applications to Fault-Tolerant Data Broadcasting. HPCC/DSS/SmartCity/DependSys (2021)
Kung-Jui Pai, Ruay-Shiung Chang, Jou-Ming Chang
A protection routing with secure mechanism in Möbius cubes. J. Parallel Distributed Comput. 140 (2020)
Shu-Li Zhao, Jou-Ming Chang, Rong-Xia Hao
Reliability assessment of the Cayley graph generated by trees. Discret. Appl. Math. 287 (2020)
Xiao-Wen Qin, Rong-Xia Hao, Kung-Jui Pai, Jou-Ming Chang
Comments on "A Hamilton sufficient condition for completely independent spanning tree". Discret. Appl. Math. 283 (2020)
Mei-Mei Gu, Jou-Ming Chang, Rong-Xia Hao
On Computing Component (Edge) Connectivities of Balanced Hypercubes. Comput. J. 63 (9) (2020)
Kung-Jui Pai, Ruay-Shiung Chang, Jou-Ming Chang
A well-equalized 3-CIST partition of alternating group graphs. Inf. Process. Lett. 155 (2020)
Mei-Mei Gu, Rong-Xia Hao, Shyue-Ming Tang, Jou-Ming Chang
Analysis on component connectivity of bubble-sort star graphs and burnt pancake graphs. Discret. Appl. Math. 279 (2020)
Yu-Hsuan Chang, Ro-Yu Wu, Cheng-Kuan Lin, Jou-Ming Chang
A Loopless Algorithm for Generating (k, m)-ary Trees in Gray-Code Order. FAW (2020)
Rong-Xia Hao, Mei-Mei Gu, Jou-Ming Chang
Relationship between extra edge connectivity and component edge connectivity for regular graphs. Theor. Comput. Sci. 833 (2020)
Chao Wei, Rong-Xia Hao, Jou-Ming Chang
Two-disjoint-cycle-cover bipancyclicity of balanced hypercubes. Appl. Math. Comput. 381 (2020)
Xiao-Wen Qin, Rong-Xia Hao, Jou-Ming Chang
The Existence of Completely Independent Spanning Trees for Some Compound Graphs. IEEE Trans. Parallel Distributed Syst. 31 (1) (2020)
Mei-Mei Gu, Jou-Ming Chang, Rong-Xia Hao
On Component Connectivity of Hierarchical Star Networks. Int. J. Found. Comput. Sci. 31 (3) (2020)
Kung-Jui Pai, Ruay-Shiung Chang, Ro-Yu Wu, Jou-Ming Chang
Three completely independent spanning trees of crossed cubes with application to secure-protection routing. Inf. Sci. 541 (2020)
Shun-Yu Li, Jou-Ming Chang, Kung-Jui Pai
A Parallel Algorithm for Constructing Two Edge-disjoint Hamiltonian Cycles in Locally Twisted Cubes. ICS (2020)
Yi-Xian Yang, Kung-Jui Pai, Ruay-Shiung Chang, Jou-Ming Chang
Constructing Two Completely Independent Spanning Trees in Balanced Hypercubes. IEICE Trans. Inf. Syst. (12) (2019)
Kung-Jui Pai, Jou-Ming Chang, Ro-Yu Wu, Shun-Chieh Chang
Amortized efficiency of generation, ranking and unranking left-child sequences in lexicographic order. Discret. Appl. Math. 268 (2019)
Shih-Shun Kao, Kung-Jui Pai, Sun-Yuan Hsieh, Ro-Yu Wu, Jou-Ming Chang
Amortized efficiency of constructing multiple independent spanning trees on bubble-sort networks. J. Comb. Optim. 38 (3) (2019)
Kung-Jui Pai, Ruay-Shiung Chang, Ro-Yu Wu, Jou-Ming Chang
Three Completely Independent Spanning Trees of Crossed Cubes with Application to Secure-Protection Routing. HPCC/SmartCity/DSS (2019)
Xiao-Wen Qin, Jou-Ming Chang, Rong-Xia Hao
Constructing dual-CISTs of DCell data center networks. Appl. Math. Comput. 362 (2019)
Mei-Mei Gu, Rong-Xia Hao, Jou-Ming Chang
Measuring the Vulnerability of Alternating Group Graphs and Split-Star Networks in Terms of Component Connectivity. IEEE Access 7 (2019)
Kung-Jui Pai, Jou-Ming Chang
Dual-CISTs: Configuring a Protection Routing on Some Cayley Networks. IEEE/ACM Trans. Netw. 27 (3) (2019)
Kung-Jui Pai, Ruay-Shiung Chang, Ro-Yu Wu, Jou-Ming Chang
A two-stages tree-searching algorithm for finding three completely independent spanning trees. Theor. Comput. Sci. 784 (2019)
Jou-Ming Chang, Kung-Jui Pai, Ro-Yu Wu, Jinn-Shyong Yang
The 4-component connectivity of alternating group networks. Theor. Comput. Sci. 766 (2019)
Yu-Hsuan Chang, Ro-Yu Wu, Ruay-Shiung Chang, Jou-Ming Chang
Improved Algorithms for Ranking and Unranking (k, m)-Ary Trees. AAIM (2019)
Kung-Jui Pai, Ruay-Shiung Chang, Jou-Ming Chang, Ro-Yu Wu
Constructing Three Completely Independent Spanning Trees in Locally Twisted Cubes. FAW (2019)
Mei-Mei Gu, Jou-Ming Chang, Rong-Xia Hao
Strong Menger connectedness of augmented k-ary n-cubes. CoRR (2019)
Kung-Jui Pai, Jou-Ming Chang
Improving the diameters of completely independent spanning trees in locally twisted cubes. Inf. Process. Lett. 141 (2019)
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) (2018)
Shih-Shun Kao, Jou-Ming Chang, Kung-Jui Pai, Ro-Yu Wu
Constructing Independent Spanning Trees on Bubble-Sort Networks. COCOON (2018)
Mei-Mei Gu, Rong-Xia Hao, Jou-Ming Chang
The Component Connectivity of Alternating Group Graphs and Split-Stars. CoRR (2018)
Yu-Liang Liu, Jou-Ming Chang
Realizing Exchanged Crossed Cube Communication Patterns on Linear Array WDM Optical Networks. Int. J. Found. Comput. Sci. 29 (6) (2018)
Shyue-Ming Tang, Yue-Li Wang, Chien-Yi Li, Jou-Ming Chang
Cycle Embedding in Generalized Recursive Circulant Graphs. IEICE Trans. Inf. Syst. (12) (2018)
Jou-Ming Chang, Kung-Jui Pai, Jinn-Shyong Yang, Ro-Yu Wu
Two Kinds of Generalized 3-Connectivities of Alternating Group Networks. FAW (2018)
Jou-Ming Chang, Kung-Jui Pai, Ro-Yu Wu, Jinn-Shyong Yang
The 4-Component Connectivity of Alternating Group Networks. CoRR (2018)
Jou-Ming Chang, Ting-Jyun Yang, Jinn-Shyong Yang
A parallel algorithm for constructing independent spanning trees in twisted cubes. Discret. Appl. Math. 219 (2017)
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)
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) (2017)
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. (9) (2017)
Kung-Jui Pai, Jou-Ming Chang, Ro-Yu Wu
A Constant Amortized Time Algorithm for Generating Left-Child Sequences in Lexicographic Order. FAW (2017)
Kung-Jui Pai, Jou-Ming Chang, Jinn-Shyong Yang
Vertex-transitivity on folded crossed cubes. Inf. Process. Lett. 116 (11) (2016)
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) (2016)
Kung-Jui Pai, Jou-Ming Chang
Constructing two completely independent spanning trees in hypercube-variant networks. Theor. Comput. Sci. 652 (2016)
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 (2016)
Kung-Jui Pai, Ro-Yu Wu, Jou-Ming Chang, Shun-Chieh Chang
Amortized Efficiency of Ranking and Unranking Left-Child Sequences in Lexicographic Order. COCOA (2016)
Ro-Yu Wu, Jou-Ming Chang, Sheng-Lung Peng, Chun-Liang Liu
Gray-Code Ranking and Unranking on Left-Weight Sequences of Binary Trees. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. (6) (2016)
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. (10) (2015)
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 (2015)
Jou-Ming Chang, Ton Kloks, Hung-Lung Wang
Gray Codes for AT-Free Orders via Antimatroids. IWOCA (2015)
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) (2015)
Hung-Lung Wang, Chun-Yu Tseng, Jou-Ming Chang
On the Structure of Locally Outerplanar Graphs. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. (6) (2015)
Jinn-Shyong Yang, Sih-Syuan Luo, Jou-Ming Chang
Pruning Longer Branches of Independent Spanning Trees on Folded Hyper-Stars. Comput. J. 58 (11) (2015)
Sheng-Lung Peng, Yan-Hao Chen, Ruay-Shiung Chang, Jou-Ming Chang
An Energy-Aware Random Multi-path Routing Protocol for MANETs. SmartCity (2015)
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) (2015)
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. (9) (2014)
Kung-Jui Pai, Jou-Ming Chang, Yue-Li Wang, Ro-Yu Wu
Queue Layouts of Toroidal Grids. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. (6) (2014)
Jinn-Shyong Yang, Jou-Ming Chang
Optimal Independent Spanning Trees on Cartesian Product of Hybrid Graphs. Comput. J. 57 (1) (2014)
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) (2014)
Kun-Fu Ding, Kung-Jui Pai, Jou-Ming Chang, Rueiher Tsaur
Some Results of Incidence Coloring on Generalized Petersen Graphs. ICS (2014)
Kung-Jui Pai, Jou-Ming Chang, Jinn-Shyong Yang, Ro-Yu Wu
Incidence coloring on hypercubes. Theor. Comput. Sci. 557 (2014)
Ro-Yu Wu, Jou-Ming Chang, Hung-Chang Chan, Kung-Jui Pai
A loopless algorithm for generating multiple binary tree sequences simultaneously. Theor. Comput. Sci. 556 (2014)
Yu-Huei Chang, Jinn-Shyong Yang, Jou-Ming Chang, Yue-Li Wang
Parallel Construction of Independent Spanning Trees on Parity Cubes. CSE (2014)
Wen-Yin Huang, Jia Jie Liu, Jou-Ming Chang, Ro-Yu Wu
Longest Fault-Free Cycles in Folded Hypercubes with Conditional Faulty Elements. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. (6) (2014)
Ro-Yu Wu, Jou-Ming Chang, An-Hang Chen, Chun-Liang Liu
-ary Trees in a Gray-Code Order. Comput. J. 56 (11) (2013)
Ro-Yu Wu, Jou-Ming Chang, An-Hang Chen, Ming-Tat Ko
Ranking and Unranking of Non-regular Trees in Gray-Code Order. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. (6) (2013)

Jou-Ming Chang.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Jou-Ming Chang