Jou-Ming Chang

172 papers A 2B 1C 5Misc 6Journal 151Unranked 7
YearRankTypeTitle / Venue / Authors
2026 J jnl
2-edge-Hamilton-connectedness of complete hypercube-like networks.
Discret. Appl. Math.
Huimei Guo, Rong-Xia Hao, Jou-Ming Chang
2026 J jnl
A Novel Diagnostic Measurement of Structural Faults in Multiprocessor Systems: Based on Component Quantity Analysis.
IEEE Trans. Reliab.
Nengjin Zhuo, Shumin Zhang, Jou-Ming Chang, Bo Zhu
2026 J jnl
A Novel Indicator for Improving the Fault-Tolerant Bipancyclicity of k-Ary n-Cube Networks With Exponential Faulty Edges.
IEEE Trans. Netw.
Hongbin Zhuang, Jou-Ming Chang, Xiaohua Jia
2026 J jnl
A novel dual-attribute fault diagnosis measure for hypercube networks.
Discret. Appl. Math.
Nengjin Zhuo, Shumin Zhang, Jou-Ming Chang, Haoyu Ma
2026 J jnl
Analysis of BCube Datacenter Network Reliability Based on Network Subversion, Neighbor Connectivity, and Cascading Failures.
IEEE Trans. Netw.
Xiao-Yan Li, Hai Liu, Wanling Lin, Hao Liu, Jou-Ming Chang
2026 J jnl
DACS: Distributed adjustable computation scheme in highly scalable data center networks based on multi-protection routing.
J. Netw. Comput. Appl.
Wanling Lin, Jou-Ming Chang, Xiao-Yan Li
2026 J jnl
Fault tolerability analysis of hypercubes based on the g -cyclic fault pattern.
Discret. Appl. Math.
Ting Tian, Shumin Zhang, Bo Zhu, Jou-Ming Chang
2026 J jnl
Identifying social network influencers: A scheme based on TOPSIS and network decomposition.
Expert Syst. Appl.
Wanling Lin, Jou-Ming Chang, Hai Liu, Xiao-Yan Li
2026 J jnl
Neighbor connectivity of bubble-sort star graphs.
Discret. Appl. Math.
Liying Zhao, Shumin Zhang, Bo Zhu, Jou-Ming Chang
2026 J jnl
Neighbor connectivity of undirected toroidal meshes.
Discret. Appl. Math.
Hui-Ming Huang, Ruichao Niu, Min Xu, Jou-Ming Chang
2026 J jnl
Optimal Fault-Tolerant Path and Cycle Embedding of Hypercube Networks Under the PEF Model.
IEEE Trans. Computers
Hongbin Zhuang, Wanling Lin, Jou-Ming Chang, Xiao-Yan Li, Xiaohua Jia
2026 J jnl
The g-Extra Mixed Connectivity of Hypercube-Like Networks.
Int. J. Found. Comput. Sci.
Tongtong Ding, Ruichao Niu, Min Xu, Jou-Ming Chang
2026 J jnl
k-edge-Hamilton-laceable bipartite graphs.
Discret. Appl. Math.
Huimei Guo, Rong-Xia Hao, Jou-Ming Chang
2026 J jnl
{ 1 , 2 , 3 } -extra connectivity of Cayley graphs generated by k -trees.
Discret. Appl. Math.
Bo Zhu, Shumin Zhang, Jou-Ming Chang, Liying Zhao
2025 J jnl
2-Edge Hamiltonian connectedness: Characterization and results in data center networks.
Appl. Math. Comput.
Mei-Li Wang, Rong-Xia Hao, Jou-Ming Chang, Sejeong Bang
2025 J jnl
A generalized approach for solving non-inclusive diagnosability of regular networks under the PMC model.
Theor. Comput. Sci.
Nengjin Zhuo, Shumin Zhang, Jou-Ming Chang, Chengfu Ye
2025 J jnl
A novel fault-tolerant technique for star graph-based interconnection networks.
J. Supercomput.
Wenfei Liu, Jiafei Liu, Jou-Ming Chang, Jingli Wu, Qi Wang
2025 J jnl
Enabling high reliability via matroidal connectivity and conditional matroidal connectivity on arrangement graph networks.
Theor. Comput. Sci.
Xiao-Yan Li, Zhaoding Lin, Hongbin Zhuang, Jou-Ming Chang
2025 J jnl
Fault-tolerability analysis of hypercubes based on 3-component path-structure connectivity.
Discret. Appl. Math.
Bo Zhu, Shumin Zhang, Jou-Ming Chang, Jinyu Zou
2025 J jnl
LP-Star: Embedding Longest Paths into Star Networks With Large-Scale Missing Edges Under an Emerging Assessment Model.
IEEE Trans. Emerg. Top. Comput.
Xiao-Yan Li, Jou-Ming Chang
2025 J jnl
Link/Switch Failure Analysis of Data Center Networks on Matroidal Connectivity.
IEEE Trans. Netw.
Wanling Lin, Xiao-Yan Li, Jou-Ming Chang, Xiaohua Jia
2025 J jnl
Link/Switch Fault-Tolerant Hamiltonian Path Embedding in BCube Networks for Deadlock-Free Routing.
IEEE Trans. Dependable Secur. Comput.
Wanling Lin, Xiao-Yan Li, Jou-Ming Chang, Dong Xiang, Xiaohua Jia
2025 J jnl
Non-inclusive diagnosability of folded hypercube-like networks.
Discret. Appl. Math.
Nengjin Zhuo, Shumin Zhang, Jou-Ming Chang, Chengfu Ye
2025 J jnl
Non-inclusive g-extra diagnosability of regular networks under the MM* model.
J. Appl. Math. Comput.
Nengjin Zhuo, Shumin Zhang, Jou-Ming Chang, Chengfu Ye
2025 J jnl
Packing internally disjoint Steiner paths of data center networks.
J. Supercomput.
Wen-Han Zhu, Rong-Xia Hao, Jou-Ming Chang, Jaeun Lee
2025 J jnl
Structure connectivity of folded crossed cubes based on faulty stars.
J. Appl. Math. Comput.
Huimei Guo, Rong-Xia Hao, Aygul Mamut, Jou-Ming Chang, Jie Wu
2025 J jnl
{1, 2}-good-neighbor conditional diagnosability of Cayley graphs generated by k-trees.
Discret. Appl. Math.
Shu-Li Zhao, Bao-Cheng Zhang, Jou-Ming Chang
2024 J jnl
A Recursive Algorithm for Constructing Dual-CISTs in Hierarchical Folded Cubic Networks.
Int. J. Found. Comput. Sci.
Hsin-Jung Lin, Shyue-Ming Tang, Kung-Jui Pai, Jou-Ming Chang
2024 J jnl
Assessing Network Reliability Through Perspectives of Neighbor Connectivity and Subversion.
IEEE Trans. Netw. Sci. Eng.
Mei-Mei Gu, Jinn-Shyong Yang, Jou-Ming Chang
2024 J jnl
Determining the 2-Tuple Total Domination Number of a Harary Graph under Specific Degree Conditions.
J. Inf. Sci. Eng.
Min-Shu Jao, Hung-Lung Wang, Jou-Ming Chang, Chia-wen Wu
2024 J jnl
Hyper star structure connectivity of hierarchical folded cubic networks.
J. Supercomput.
Huimei Guo, Rong-Xia Hao, Jou-Ming Chang, Young Soo Kwon
2024 J jnl
On the minimum size of graphs with given generalized connectivity.
Discret. Appl. Math.
Shu-Li Zhao, Hengzhe Li, Jou-Ming Chang
2024 J jnl
Paired 2-disjoint path covers of k-ary n-cubes under the partitioned edge fault model.
J. Parallel Distributed Comput.
Hongbin Zhuang, Xiao-Yan Li, Jou-Ming Chang, Ximeng Liu
2024 J jnl
Two-disjoint-cycle-cover pancyclicity of data center networks.
Appl. Math. Comput.
Rong-Xia Hao, Xiao-Wen Qin, Hui Zhang, Jou-Ming Chang
2023 J jnl
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.
Hongbin Zhuang, Xiao-Yan Li, Jou-Ming Chang, Dajin Wang
2023 J jnl
Connectivity, super connectivity and generalized 3-connectivity of folded divide-and-swap cubes.
Inf. Process. Lett.
Shu-Li Zhao, Jou-Ming Chang
2023 J jnl
Constructing Multiple CISTs on BCube-Based Data Center Networks in the Occurrence of Switch Failures.
IEEE Trans. Computers
Wanling Lin, Xiao-Yan Li, Jou-Ming Chang, Xiaohua Jia
2023 J jnl
Embedding Hamiltonian Paths in $k$-Ary $n$-Cubes With Exponentially-Many Faulty Edges.
IEEE Trans. Computers
Hongbin Zhuang, Xiao-Yan Li, Jou-Ming Chang, Cheng-Kuan Lin, Ximeng Liu
2023 J jnl
Matroidal connectivity and conditional matroidal connectivity of star graphs.
Theor. Comput. Sci.
Hongbin Zhuang, Wanling Lin, Xiao-Yan Li, Jou-Ming Chang
2023 J jnl
Neighbor connectivity of pancake graphs and burnt pancake graphs.
Discret. Appl. Math.
Mei-Mei Gu, Jou-Ming Chang
2023 J jnl
Reliability assessment of the divide-and-swap cube in terms of generalized connectivity.
Theor. Comput. Sci.
Shu-Li Zhao, Jou-Ming Chang
2023 J jnl
Subversion analyses of hierarchical networks based on (edge) neighbor connectivity.
J. Parallel Distributed Comput.
Mei-Mei Gu, Kung-Jui Pai, Jou-Ming Chang
2023 J jnl
The generalized 4-connectivity of pancake graphs.
Discret. Appl. Math.
Shu-Li Zhao, Jou-Ming Chang, Hengzhe Li
2023 J jnl
Three edge-disjoint Hamiltonian cycles in crossed cubes with applications to fault-tolerant data broadcasting.
J. Supercomput.
Kung-Jui Pai, Ro-Yu Wu, Sheng-Lung Peng, Jou-Ming Chang
2022 J jnl
A secure data transmission scheme based on multi-protection routing in datacenter networks.
J. Parallel Distributed Comput.
Xiao-Yan Li, Wanling Lin, Wenzhong Guo, Jou-Ming Chang
2022 J jnl
Completely Independent Spanning Trees on BCCC Data Center Networks With an Application to Fault-Tolerant Routing.
IEEE Trans. Parallel Distributed Syst.
Xiao-Yan Li, Wanling Lin, Ximeng Liu, Cheng-Kuan Lin, Kung-Jui Pai, Jou-Ming Chang
2022 J jnl
Configuring Protection Routing via Completely Independent Spanning Trees in Dense Gaussian On-Chip Networks.
IEEE Trans. Netw. Sci. Eng.
Kung-Jui Pai, Jinn-Shyong Yang, Guan-Yu Chen, Jou-Ming Chang
2022 J jnl
Constructing tri-CISTs in shuffle-cubes.
J. Comb. Optim.
Yu-Han Chen, Kung-Jui Pai, Hsin-Jung Lin, Jou-Ming Chang
2022 C conf
Generating Spanning-Tree Sequences of a Fan Graph in Lexicographic Order and Ranking/Unranking Algorithms.
ISCO
Ro-Yu Wu, Cheng-Chia Tseng, Ling-Ju Hung, Jou-Ming Chang
2022 J jnl
Improved algorithms for ranking and unranking (k, m)-ary trees in B-order.
J. Comb. Optim.
Yu-Hsuan Chang, Ro-Yu Wu, Ruay-Shiung Chang, Jou-Ming Chang
2022 J jnl
Parallel construction of multiple independent spanning trees on highly scalable datacenter networks.
Appl. Math. Comput.
Jinn-Shyong Yang, Xiao-Yan Li, Sheng-Lung Peng, Jou-Ming Chang
2022 J jnl
Transmission Failure Analysis of Multi-Protection Routing in Data Center Networks With Heterogeneous Edge-Core Servers.
IEEE/ACM Trans. Netw.
Xiao-Yan Li, Wanling Lin, Jou-Ming Chang, Xiaohua Jia
2021 J jnl
A Note on Super Connectivity of the Bouwer Graph.
J. Interconnect. Networks
Mei-Mei Gu, Jou-Ming Chang
2021 J jnl
A loopless algorithm for generating (k, m)-ary trees in Gray code order.
Optim. Lett.
Yu-Hsuan Chang, Ro-Yu Wu, Cheng-Kuan Lin, Jou-Ming Chang
2021 Misc conf
Constructing Tri-CISTs in Shuffle-Cubes.
COCOON
Yu-Han Chen, Kung-Jui Pai, Hsin-Jung Lin, Jou-Ming Chang
2021 J jnl
Constructing dual-CISTs of folded divide-and-swap cubes.
Theor. Comput. Sci.
Yu-Huei Chang, Kung-Jui Pai, Chiun-Chieh Hsu, Jinn-Shyong Yang, Jou-Ming Chang
2021 J jnl
Constructing dual-CISTs of pancake graphs and performance assessment of protection routings on some Cayley networks.
J. Supercomput.
Kung-Jui Pai, Ruay-Shiung Chang, Jou-Ming Chang
2021 J jnl
Constructing dual-CISTs with short diameters using a generic adjustment scheme on bicubes.
Theor. Comput. Sci.
Yu-Han Chen, Shyue-Ming Tang, Kung-Jui Pai, Jou-Ming Chang
2021 J jnl
Packing internally disjoint Steiner trees to compute the
J. Parallel Distributed Comput.
Chao Wei, Rong-Xia Hao, Jou-Ming Chang
2021 J jnl
Reliability Analysis of Alternating Group Graphs and Split-Stars.
Comput. J.
Mei-Mei Gu, Rong-Xia Hao, Jou-Ming Chang
2021 J jnl
Strong Menger Connectedness of Augmented k-ary n-cubes.
Comput. J.
Mei-Mei Gu, Jou-Ming Chang, Rong-Xia Hao
2021 J jnl
The Construction of Multiple Independent Spanning Trees on Burnt Pancake Networks.
IEEE Access
Yi-Cheng Yang, Shih-Shun Kao, Ralf Klasing, Sun-Yuan Hsieh, Hsin-Hung Chou, Jou-Ming Chang
2021 J jnl
The reliability analysis based on the generalized connectivity in balanced hypercubes.
Discret. Appl. Math.
Chao Wei, Rong-Xia Hao, Jou-Ming Chang
2021 — conf
Three Edge-Disjoint Hamiltonian Cycles in Crossed Cubes with Applications to Fault-Tolerant Data Broadcasting.
HPCC/DSS/SmartCity/DependSys
Kung-Jui Pai, Ro-Yu Wu, Sheng-Lung Peng, Jou-Ming Chang
2021 J jnl
Transmission Failure Analysis of Multi-Protection Routing in Data Center Networks with Heterogeneous Edge-Core Servers.
CoRR
Xiao-Yan Li, Wanling Lin, Jou-Ming Chang, Xiaohua Jia
2020 Misc conf
A Loopless Algorithm for Generating (k, m)-ary Trees in Gray-Code Order.
FAW
Yu-Hsuan Chang, Ro-Yu Wu, Cheng-Kuan Lin, Jou-Ming Chang
2020 A conf
A Parallel Algorithm for Constructing Two Edge-disjoint Hamiltonian Cycles in Locally Twisted Cubes.
ICS
Shun-Yu Li, Jou-Ming Chang, Kung-Jui Pai
2020 J jnl
A protection routing with secure mechanism in Möbius cubes.
J. Parallel Distributed Comput.
Kung-Jui Pai, Ruay-Shiung Chang, Jou-Ming Chang
2020 J jnl
A well-equalized 3-CIST partition of alternating group graphs.
Inf. Process. Lett.
Kung-Jui Pai, Ruay-Shiung Chang, Jou-Ming Chang
2020 J jnl
Analysis on component connectivity of bubble-sort star graphs and burnt pancake graphs.
Discret. Appl. Math.
Mei-Mei Gu, Rong-Xia Hao, Shyue-Ming Tang, Jou-Ming Chang
2020 J jnl
Comments on "A Hamilton sufficient condition for completely independent spanning tree".
Discret. Appl. Math.
Xiao-Wen Qin, Rong-Xia Hao, Kung-Jui Pai, Jou-Ming Chang
2020 J jnl
On Component Connectivity of Hierarchical Star Networks.
Int. J. Found. Comput. Sci.
Mei-Mei Gu, Jou-Ming Chang, Rong-Xia Hao
2020 J jnl
On Computing Component (Edge) Connectivities of Balanced Hypercubes.
Comput. J.
Mei-Mei Gu, Jou-Ming Chang, Rong-Xia Hao
2020 J jnl
Relationship between extra edge connectivity and component edge connectivity for regular graphs.
Theor. Comput. Sci.
Rong-Xia Hao, Mei-Mei Gu, Jou-Ming Chang
2020 J jnl
Reliability assessment of the Cayley graph generated by trees.
Discret. Appl. Math.
Shu-Li Zhao, Jou-Ming Chang, Rong-Xia Hao
2020 J jnl
The Existence of Completely Independent Spanning Trees for Some Compound Graphs.
IEEE Trans. Parallel Distributed Syst.
Xiao-Wen Qin, Rong-Xia Hao, Jou-Ming Chang
2020 J jnl
Three completely independent spanning trees of crossed cubes with application to secure-protection routing.
Inf. Sci.
Kung-Jui Pai, Ruay-Shiung Chang, Ro-Yu Wu, Jou-Ming Chang
2020 J jnl
Two-disjoint-cycle-cover bipancyclicity of balanced hypercubes.
Appl. Math. Comput.
Chao Wei, Rong-Xia Hao, Jou-Ming Chang
2019 J jnl
A two-stages tree-searching algorithm for finding three completely independent spanning trees.
Theor. Comput. Sci.
Kung-Jui Pai, Ruay-Shiung Chang, Ro-Yu Wu, Jou-Ming Chang
2019 J jnl
Amortized efficiency of constructing multiple independent spanning trees on bubble-sort networks.
J. Comb. Optim.
Shih-Shun Kao, Kung-Jui Pai, Sun-Yuan Hsieh, Ro-Yu Wu, Jou-Ming Chang
2019 J jnl
Amortized efficiency of generation, ranking and unranking left-child sequences in lexicographic order.
Discret. Appl. Math.
Kung-Jui Pai, Jou-Ming Chang, Ro-Yu Wu, Shun-Chieh Chang
2019 Misc conf
Constructing Three Completely Independent Spanning Trees in Locally Twisted Cubes.
FAW
Kung-Jui Pai, Ruay-Shiung Chang, Jou-Ming Chang, Ro-Yu Wu
2019 J jnl
Constructing Two Completely Independent Spanning Trees in Balanced Hypercubes.
IEICE Trans. Inf. Syst.
Yi-Xian Yang, Kung-Jui Pai, Ruay-Shiung Chang, Jou-Ming Chang
2019 J jnl
Constructing dual-CISTs of DCell data center networks.
Appl. Math. Comput.
Xiao-Wen Qin, Jou-Ming Chang, Rong-Xia Hao
2019 J jnl
Dual-CISTs: Configuring a Protection Routing on Some Cayley Networks.
IEEE/ACM Trans. Netw.
Kung-Jui Pai, Jou-Ming Chang
2019 C conf
Improved Algorithms for Ranking and Unranking (k, m)-Ary Trees.
AAIM
Yu-Hsuan Chang, Ro-Yu Wu, Ruay-Shiung Chang, Jou-Ming Chang
2019 J jnl
Improving the diameters of completely independent spanning trees in locally twisted cubes.
Inf. Process. Lett.
Kung-Jui Pai, Jou-Ming Chang
2019 J jnl
Measuring the Vulnerability of Alternating Group Graphs and Split-Star Networks in Terms of Component Connectivity.
IEEE Access
Mei-Mei Gu, Rong-Xia Hao, Jou-Ming Chang
2019 J jnl
Strong Menger connectedness of augmented k-ary n-cubes.
CoRR
Mei-Mei Gu, Jou-Ming Chang, Rong-Xia Hao
2019 J jnl
The 4-component connectivity of alternating group networks.
Theor. Comput. Sci.
Jou-Ming Chang, Kung-Jui Pai, Ro-Yu Wu, Jinn-Shyong Yang
2019 — conf
Three Completely Independent Spanning Trees of Crossed Cubes with Application to Secure-Protection Routing.
HPCC/SmartCity/DSS
Kung-Jui Pai, Ruay-Shiung Chang, Ro-Yu Wu, Jou-Ming Chang
2018 Misc conf
Constructing Independent Spanning Trees on Bubble-Sort Networks.
COCOON
Shih-Shun Kao, Jou-Ming Chang, Kung-Jui Pai, Ro-Yu Wu
2018 J jnl
Cycle Embedding in Generalized Recursive Circulant Graphs.
IEICE Trans. Inf. Syst.
Shyue-Ming Tang, Yue-Li Wang, Chien-Yi Li, Jou-Ming Chang
2018 J jnl
Realizing Exchanged Crossed Cube Communication Patterns on Linear Array WDM Optical Networks.
Int. J. Found. Comput. Sci.
Yu-Liang Liu, Jou-Ming Chang
2018 J jnl
The 4-Component Connectivity of Alternating Group Networks.
CoRR
Jou-Ming Chang, Kung-Jui Pai, Ro-Yu Wu, Jinn-Shyong Yang
2018 J jnl
The Component Connectivity of Alternating Group Graphs and Split-Stars.
CoRR
Mei-Mei Gu, Rong-Xia Hao, Jou-Ming Chang
2018 J jnl
The Wide Diameters of Regular Hyper-Stars and Folded Hyper-Stars.
Comput. J.
Jou-Ming Chang, Jinn-Shyong Yang, Shyue-Ming Tang, Kung-Jui Pai
2018 Misc conf
Two Kinds of Generalized 3-Connectivities of Alternating Group Networks.
FAW
Jou-Ming Chang, Kung-Jui Pai, Jinn-Shyong Yang, Ro-Yu Wu
2017 Misc conf
A Constant Amortized Time Algorithm for Generating Left-Child Sequences in Lexicographic Order.
FAW
Kung-Jui Pai, Jou-Ming Chang, Ro-Yu Wu
2017 — conf
A Parallel Construction of Vertex-Disjoint Spanning Trees with Optimal Heights in Star Networks.
COCOA (1)
Shih-Shun Kao, Jou-Ming Chang, Kung-Jui Pai, Jinn-Shyong Yang, Shyue-Ming Tang, Ro-Yu Wu
2017 J jnl
A parallel algorithm for constructing independent spanning trees in twisted cubes.
Discret. Appl. Math.
Jou-Ming Chang, Ting-Jyun Yang, Jinn-Shyong Yang
2017 J jnl
Completely Independent Spanning Trees on 4-Regular Chordal Rings.
IEICE Trans. Fundam. Electron. Commun. Comput. Sci.
Jou-Ming Chang, Hung-Yi Chang, Hung-Lung Wang, Kung-Jui Pai, Jinn-Shyong Yang
2017 J jnl
Construction independent spanning trees on locally twisted cubes in parallel.
J. Comb. Optim.
Yu-Huei Chang, Jinn-Shyong Yang, Sun-Yuan Hsieh, Jou-Ming Chang, Yue-Li Wang
2016 C conf
Amortized Efficiency of Ranking and Unranking Left-Child Sequences in Lexicographic Order.
COCOA
Kung-Jui Pai, Ro-Yu Wu, Jou-Ming Chang, Shun-Chieh Chang
2016 J jnl
Constructing two completely independent spanning trees in hypercube-variant networks.
Theor. Comput. Sci.
Kung-Jui Pai, Jou-Ming Chang
2016 J jnl
Corrigendum to "Incidence coloring on hypercubes" [Theoret. Comput. Sci. 557 (2014) 59-65].
Theor. Comput. Sci.
Kung-Jui Pai, Jou-Ming Chang, Jinn-Shyong Yang, Ro-Yu Wu
2016 J jnl
Gray-Code Ranking and Unranking on Left-Weight Sequences of Binary Trees.
IEICE Trans. Fundam. Electron. Commun. Comput. Sci.
Ro-Yu Wu, Jou-Ming Chang, Sheng-Lung Peng, Chun-Liang Liu
2016 J jnl
Locally exchanged twisted cubes: Connectivity and super connectivity.
Inf. Process. Lett.
Jou-Ming Chang, Xiang-Rui Chen, Jinn-Shyong Yang, Ro-Yu Wu
2016 J jnl
Vertex-transitivity on folded crossed cubes.
Inf. Process. Lett.
Kung-Jui Pai, Jou-Ming Chang, Jinn-Shyong Yang
2015 J jnl
A Fast Parallel Algorithm for Constructing Independent Spanning Trees on Parity Cubes.
Appl. Math. Comput.
Yu-Huei Chang, Jinn-Shyong Yang, Jou-Ming Chang, Yue-Li Wang
2015 J jnl
A Note on the Degree Condition of Completely Independent Spanning Trees.
IEICE Trans. Fundam. Electron. Commun. Comput. Sci.
Hung-Yi Chang, Hung-Lung Wang, Jinn-Shyong Yang, Jou-Ming Chang
2015 J jnl
A fully parallelized scheme of constructing independent spanning trees on Möbius cubes.
J. Supercomput.
Jinn-Shyong Yang, Meng-Ru Wu, Jou-Ming Chang, Yu-Huei Chang
2015 — conf
An Energy-Aware Random Multi-path Routing Protocol for MANETs.
SmartCity
Sheng-Lung Peng, Yan-Hao Chen, Ruay-Shiung Chang, Jou-Ming Chang
2015 C conf
Gray Codes for AT-Free Orders via Antimatroids.
IWOCA
Jou-Ming Chang, Ton Kloks, Hung-Lung Wang
2015 J jnl
On the Structure of Locally Outerplanar Graphs.
IEICE Trans. Fundam. Electron. Commun. Comput. Sci.
Hung-Lung Wang, Chun-Yu Tseng, Jou-Ming Chang
2015 J jnl
Parallel Construction of Independent Spanning Trees on Enhanced Hypercubes.
IEEE Trans. Parallel Distributed Syst.
Jinn-Shyong Yang, Jou-Ming Chang, Kung-Jui Pai, Hung-Chang Chan
2015 J jnl
Pruning Longer Branches of Independent Spanning Trees on Folded Hyper-Stars.
Comput. J.
Jinn-Shyong Yang, Sih-Syuan Luo, Jou-Ming Chang
2014 J jnl
A comment on "Independent spanning trees in crossed cubes".
Inf. Process. Lett.
Jou-Ming Chang, Jhen-Ding Wang, Jinn-Shyong Yang, Kung-Jui Pai
2014 J jnl
A loopless algorithm for generating multiple binary tree sequences simultaneously.
Theor. Comput. Sci.
Ro-Yu Wu, Jou-Ming Chang, Hung-Chang Chan, Kung-Jui Pai
2014 J jnl
Completely Independent Spanning Trees on Some Interconnection Networks.
IEICE Trans. Inf. Syst.
Kung-Jui Pai, Jinn-Shyong Yang, Sing-Chen Yao, Shyue-Ming Tang, Jou-Ming Chang
2014 J jnl
Incidence coloring on hypercubes.
Theor. Comput. Sci.
Kung-Jui Pai, Jou-Ming Chang, Jinn-Shyong Yang, Ro-Yu Wu
2014 J jnl
Longest Fault-Free Cycles in Folded Hypercubes with Conditional Faulty Elements.
IEICE Trans. Fundam. Electron. Commun. Comput. Sci.
Wen-Yin Huang, Jia Jie Liu, Jou-Ming Chang, Ro-Yu Wu
2014 J jnl
Optimal Independent Spanning Trees on Cartesian Product of Hybrid Graphs.
Comput. J.
Jinn-Shyong Yang, Jou-Ming Chang
2014 — conf
Parallel Construction of Independent Spanning Trees on Parity Cubes.
CSE
Yu-Huei Chang, Jinn-Shyong Yang, Jou-Ming Chang, Yue-Li Wang
2014 J jnl
Queue Layouts of Toroidal Grids.
IEICE Trans. Fundam. Electron. Commun. Comput. Sci.
Kung-Jui Pai, Jou-Ming Chang, Yue-Li Wang, Ro-Yu Wu
2014 A conf
Some Results of Incidence Coloring on Generalized Petersen Graphs.
ICS
Kun-Fu Ding, Kung-Jui Pai, Jou-Ming Chang, Rueiher Tsaur
2013 C conf
A Loopless Algorithm for Generating Multiple Binary Tree Sequences Simultaneously.
COCOA
Ro-Yu Wu, Jou-Ming Chang, Hung-Chang Chan, Kung-Jui Pai
2013 J jnl
Power Domination in Honeycomb Meshes.
J. Inf. Sci. Eng.
Kuo-Hua Kao, Jou-Ming Chang, Yue-Li Wang, Shuo-Hong Xu, Justie Su-tzu Juan
2013 J jnl
Ranking and Unranking
Comput. J.
Ro-Yu Wu, Jou-Ming Chang, An-Hang Chen, Chun-Liang Liu
2013 J jnl
Ranking and Unranking of Non-regular Trees in Gray-Code Order.
IEICE Trans. Fundam. Electron. Commun. Comput. Sci.
Ro-Yu Wu, Jou-Ming Chang, An-Hang Chen, Ming-Tat Ko
2011 J jnl
A Quadratic Algorithm for Finding Next-to-Shortest Paths in Graphs.
Algorithmica
Kuo-Hua Kao, Jou-Ming Chang, Yue-Li Wang, Justie Su-tzu Juan
2011 J jnl
Amortized efficiency of generating planar paths in convex position.
Theor. Comput. Sci.
Ro-Yu Wu, Jou-Ming Chang, Kung-Jui Pai, Yue-Li Wang
2011 J jnl
Broadcasting secure messages via optimal independent spanning trees in folded hypercubes.
Discret. Appl. Math.
Jinn-Shyong Yang, Hung-Chang Chan, Jou-Ming Chang
2011 J jnl
Ranking and Unranking of
IEICE Trans. Inf. Syst.
Ro-Yu Wu, Jou-Ming Chang, Yue-Li Wang
2011 J jnl
Ranking and unranking of non-regular trees with a prescribed branching sequence.
Math. Comput. Model.
Ro-Yu Wu, Jou-Ming Chang, Chir-Ho Chang
2010 J jnl
A new upper bound on the queuenumber of hypercubes.
Discret. Math.
Kung-Jui Pai, Jou-Ming Chang, Yue-Li Wang
2010 J jnl
Constructing Multiple Independent Spanning Trees on Recursive circulant Graphs G(2
Int. J. Found. Comput. Sci.
Jinn-Shyong Yang, Jou-Ming Chang, Shyue-Ming Tang, Yue-Li Wang
2010 J jnl
Erratum to "A new upper bound on the queuenumber of hypercubes" [Discrete Mathematics 310 (2010) 935-939].
Discret. Math.
Kung-Jui Pai, Jou-Ming Chang, Yue-Li Wang
2010 J jnl
Independent Spanning Trees on Multidimensional Torus Networks.
IEEE Trans. Computers
Shyue-Ming Tang, Jinn-Shyong Yang, Yue-Li Wang, Jou-Ming Chang
2010 J jnl
Independent spanning trees on folded hyper-stars.
Networks
Jinn-Shyong Yang, Jou-Ming Chang
2010 J jnl
Independent spanning trees vs. edge-disjoint spanning trees in locally twisted cubes.
Inf. Process. Lett.
Jia-Cian Lin, Jinn-Shyong Yang, Chiun-Chieh Hsu, Jou-Ming Chang
2010 J jnl
Loopless Generation of Non-regular Trees with a Prescribed Branching Sequence.
Comput. J.
Ro-Yu Wu, Jou-Ming Chang, Yue-Li Wang
2010 J jnl
Restricted power domination and fault-tolerant power domination on grids.
Discret. Appl. Math.
Kung-Jui Pai, Jou-Ming Chang, Yue-Li Wang
2009 — conf
A Developed Restricted Rotation for Binary Trees Transformation.
HIS (1)
Ro-Yu Wu, Jou-Ming Chang, Chir-Ho Chang
2009 J jnl
Geodesic-pancyclicity and fault-tolerant panconnectivity of augmented cubes.
Appl. Math. Comput.
Hung-Chang Chan, Jou-Ming Chang, Yue-Li Wang, Shi-Jinn Horng
2009 — conf
Independent Spanning Trees on Folded Hypercubes.
ISPAN
Jinn-Shyong Yang, Jou-Ming Chang, Hung Chan
2009 J jnl
On the diameter of geometric path graphs of points in convex position.
Inf. Process. Lett.
Jou-Ming Chang, Ro-Yu Wu
2009 J jnl
On the independent spanning trees of recursive circulant graphs G(cd
Theor. Comput. Sci.
Jinn-Shyong Yang, Jou-Ming Chang, Shyue-Ming Tang, Yue-Li Wang
2009 J jnl
The Interchange Graphs of Tournaments with Minimum Score Vectors Are Exactly Hypercubes.
Graphs Comb.
An-Hang Chen, Jou-Ming Chang, Yue-Li Wang
2009 J jnl
Upper bounds on the queuenumber of k-ary n-cubes.
Inf. Process. Lett.
Kung-Jui Pai, Jou-Ming Chang, Yue-Li Wang
2008 J jnl
A Note on "An improved upper bound on the queuenumber of the hypercube".
Inf. Process. Lett.
Kung-Jui Pai, Jou-Ming Chang, Yue-Li Wang
2008 J jnl
Fault-tolerant cycle-embedding in alternating group graphs.
Appl. Math. Comput.
Jou-Ming Chang, Jinn-Shyong Yang
2008 J jnl
The existence and uniqueness of strong kings in tournaments.
Discret. Math.
An-Hang Chen, Jou-Ming Chang, Yuwen Cheng, Yue-Li Wang
2007 J jnl
Geodesic-pancyclic graphs.
Discret. Appl. Math.
Hung-Chang Chan, Jou-Ming Chang, Yue-Li Wang, Shi-Jinn Horng
2007 J jnl
Parallel construction of optimal independent spanning trees on hypercubes.
Parallel Comput.
Jinn-Shyong Yang, Shyue-Ming Tang, Jou-Ming Chang, Yue-Li Wang
2007 J jnl
Reducing the Height of Independent Spanning Trees in Chordal Rings.
IEEE Trans. Parallel Distributed Syst.
Jinn-Shyong Yang, Jou-Ming Chang, Shyue-Ming Tang, Yue-Li Wang
2006 J jnl
A Sufficient Condition for Quasi-Claw-Free Hamiltonian Graphs.
Ars Comb.
Jou-Ming Chang, An-Hang Chen
2006 J jnl
A linear time algorithm for binary tree sequences transformation using left-arm and right-arm rotations.
Theor. Comput. Sci.
Ro-Yu Wu, Jou-Ming Chang, Yue-Li Wang
2006 J jnl
The lower and upper forcing geodetic numbers of block-cactus graphs.
Eur. J. Oper. Res.
Fu-Hsing Wang, Yue-Li Wang, Jou-Ming Chang
2005 J jnl
An efficient algorithm for estimating rotation distance between two binary trees.
Int. J. Comput. Math.
Yen-Ju Chen, Jou-Ming Chang, Yue-Li Wang
2005 J jnl
An efficient distributed algorithm for finding all hinge vertices in networks.
Int. J. Comput. Math.
Ting-Yem Ho, Jou-Ming Chang
2004 J jnl
Feedback vertex sets in star graphs.
Inf. Process. Lett.
Fu-Hsing Wang, Yue-Li Wang, Jou-Ming Chang
2004 J jnl
Panconnectivity, fault-tolerant hamiltonicity and hamiltonian-connectivity in alternating group graphs.
Networks
Jou-Ming Chang, Jinn-Shyong Yang, Yue-Li Wang, Yuwen Cheng
2003 J jnl
Distributed algorithms for finding the unique minimum distance dominating set in directed split-stars.
J. Parallel Distributed Comput.
Fu-Hsing Wang, Jou-Ming Chang, Yue-Li Wang, Sun-Jen Huang
2003 J jnl
Induced matchings in asteroidal triple-free graphs.
Discret. Appl. Math.
Jou-Ming Chang
2003 J jnl
Powers of Asteroidal Triple-free Graphs with Applications.
Ars Comb.
Jou-Ming Chang, Chin-Wen Ho, Ming-Tat Ko
2003 J jnl
Sorting a sequence of strong kings in a tournament.
Inf. Process. Lett.
Ting-Yem Ho, Jou-Ming Chang
2000 J jnl
On the powers of graphs with bounded asteroidal number.
Discret. Math.
Ting-Yem Ho, Jou-Ming Chang, Yue-Li Wang
1999 B conf
LexBFS-Ordering in Asteroidal Triple-Free Graphs.
ISAAC
Jou-Ming Chang, Chin-Wen Ho, Ming-Tat Ko
1999 J jnl
Solving the All-Pairs-Shortest-Lengt Problem on Chordal Bipartite Graphs.
Inf. Process. Lett.
Chin-Wen Ho, Jou-Ming Chang
1998 J jnl
The Recognition of Geodetically Connected Graphs.
Inf. Process. Lett.
Jou-Ming Chang, Chin-Wen Ho
1997 J jnl
Finding the Set of All Hinge Vertices for Strongly Chordal Graphs in Linear Time.
Inf. Sci.
Jou-Ming Chang, Chiun-Chieh Hsu, Yue-Li Wang, Ting-Yem Ho