Jou-Ming Chang

IEEE Trans. Netw. Sci. Eng., 2024

Paired 2-disjoint path covers of k-ary n-cubes under the partitioned edge fault model.

[BibT_eX]

[DOI]

J. Parallel Distributed Comput., 2024

On the minimum size of graphs with given generalized connectivity.

[BibT_eX]

[DOI]

Hengzhe Li

Discret. Appl. Math., 2024

Two-disjoint-cycle-cover pancyclicity of data center networks.

[BibT_eX]

[DOI]

Appl. Math. Comput., 2024

2023

Embedding Hamiltonian Paths in $k$-Ary $n$-Cubes With Exponentially-Many Faulty Edges.

[BibT_eX]

[DOI]

IEEE Trans. Computers, November, 2023

Matroidal connectivity and conditional matroidal connectivity of star graphs.

[BibT_eX]

[DOI]

Theor. Comput. Sci., October, 2023

Connectivity, super connectivity and generalized 3-connectivity of folded divide-and-swap cubes.

[BibT_eX]

[DOI]

Inf. Process. Lett., August, 2023

Constructing Multiple CISTs on BCube-Based Data Center Networks in the Occurrence of Switch Failures.

[BibT_eX]

[DOI]

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.

[BibT_eX]

[DOI]

IEEE Trans. Parallel Distributed Syst., June, 2023

Three edge-disjoint Hamiltonian cycles in crossed cubes with applications to fault-tolerant data broadcasting.

[BibT_eX]

[DOI]

J. Supercomput., March, 2023

Subversion analyses of hierarchical networks based on (edge) neighbor connectivity.

[BibT_eX]

[DOI]

J. Parallel Distributed Comput., January, 2023

Reliability assessment of the divide-and-swap cube in terms of generalized connectivity.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2023

The generalized 4-connectivity of pancake graphs.

[BibT_eX]

[DOI]

Hengzhe Li

Discret. Appl. Math., 2023

Neighbor connectivity of pancake graphs and burnt pancake graphs.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2023

2022

Completely Independent Spanning Trees on BCCC Data Center Networks With an Application to Fault-Tolerant Routing.

[BibT_eX]

[DOI]

IEEE Trans. Parallel Distributed Syst., 2022

Transmission Failure Analysis of Multi-Protection Routing in Data Center Networks With Heterogeneous Edge-Core Servers.

[BibT_eX]

[DOI]

IEEE/ACM Trans. Netw., 2022

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

[BibT_eX]

[DOI]

IEEE Trans. Netw. Sci. Eng., 2022

A secure data transmission scheme based on multi-protection routing in datacenter networks.

[BibT_eX]

[DOI]

J. Parallel Distributed Comput., 2022

Constructing tri-CISTs in shuffle-cubes.

[BibT_eX]

[DOI]

J. Comb. Optim., 2022

Improved algorithms for ranking and unranking (k, m)-ary trees in B-order.

[BibT_eX]

[DOI]

J. Comb. Optim., 2022

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

[BibT_eX]

[DOI]

Appl. Math. Comput., 2022

Generating Spanning-Tree Sequences of a Fan Graph in Lexicographic Order and Ranking/Unranking Algorithms.

[BibT_eX]

[DOI]

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.

[BibT_eX]

[DOI]

Ruay-Shiung Chang

J. Supercomput., 2021

Constructing dual-CISTs with short diameters using a generic adjustment scheme on bicubes.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2021

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

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2021

A loopless algorithm for generating (k, m)-ary trees in Gray code order.

[BibT_eX]

[DOI]

Optim. Lett., 2021

Packing internally disjoint Steiner trees to compute the κ3-connectivity in augmented cubes.

[BibT_eX]

[DOI]

Chao Wei

J. Parallel Distributed Comput., 2021

A Note on Super Connectivity of the Bouwer Graph.

[BibT_eX]

[DOI]

J. Interconnect. Networks, 2021

The reliability analysis based on the generalized connectivity in balanced hypercubes.

[BibT_eX]

[DOI]

Chao Wei

Discret. Appl. Math., 2021

Reliability Analysis of Alternating Group Graphs and Split-Stars.

[BibT_eX]

[DOI]

Comput. J., 2021

Strong Menger Connectedness of Augmented k-ary n-cubes.

[BibT_eX]

[DOI]

Comput. J., 2021

The Construction of Multiple Independent Spanning Trees on Burnt Pancake Networks.

[BibT_eX]

[DOI]

IEEE Access, 2021

2020

The Existence of Completely Independent Spanning Trees for Some Compound Graphs.

[BibT_eX]

[DOI]

Xiao-Wen Qin

IEEE Trans. Parallel Distributed Syst., 2020

Relationship between extra edge connectivity and component edge connectivity for regular graphs.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2020

A protection routing with secure mechanism in Möbius cubes.

[BibT_eX]

[DOI]

Ruay-Shiung Chang

J. Parallel Distributed Comput., 2020

Three completely independent spanning trees of crossed cubes with application to secure-protection routing.

[BibT_eX]

[DOI]

Inf. Sci., 2020

A well-equalized 3-CIST partition of alternating group graphs.

[BibT_eX]

[DOI]

Ruay-Shiung Chang

Inf. Process. Lett., 2020

On Component Connectivity of Hierarchical Star Networks.

[BibT_eX]

[DOI]

Int. J. Found. Comput. Sci., 2020

Reliability assessment of the Cayley graph generated by trees.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2020

Comments on "A Hamilton sufficient condition for completely independent spanning tree".

[BibT_eX]

[DOI]

Discret. Appl. Math., 2020

Analysis on component connectivity of bubble-sort star graphs and burnt pancake graphs.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2020

On Computing Component (Edge) Connectivities of Balanced Hypercubes.

[BibT_eX]

[DOI]

Comput. J., 2020

Two-disjoint-cycle-cover bipancyclicity of balanced hypercubes.

[BibT_eX]

[DOI]

Chao Wei

Appl. Math. Comput., 2020

A Parallel Algorithm for Constructing Two Edge-disjoint Hamiltonian Cycles in Locally Twisted Cubes.

[BibT_eX]

[DOI]

Shun-Yu Li

Proceedings of the International Computer Symposium, 2020

2019

Dual-CISTs: Configuring a Protection Routing on Some Cayley Networks.

[BibT_eX]

[DOI]

IEEE/ACM Trans. Netw., 2019

A two-stages tree-searching algorithm for finding three completely independent spanning trees.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2019

The 4-component connectivity of alternating group networks.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2019

Amortized efficiency of constructing multiple independent spanning trees on bubble-sort networks.

[BibT_eX]

[DOI]

J. Comb. Optim., 2019

Improving the diameters of completely independent spanning trees in locally twisted cubes.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2019

Constructing Two Completely Independent Spanning Trees in Balanced Hypercubes.

[BibT_eX]

[DOI]

IEICE Trans. Inf. Syst., 2019

Amortized efficiency of generation, ranking and unranking left-child sequences in lexicographic order.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2019

Constructing dual-CISTs of DCell data center networks.

[BibT_eX]

[DOI]

Xiao-Wen Qin

Appl. Math. Comput., 2019

Measuring the Vulnerability of Alternating Group Graphs and Split-Star Networks in Terms of Component Connectivity.

[BibT_eX]

[DOI]

IEEE Access, 2019

Constructing Three Completely Independent Spanning Trees in Locally Twisted Cubes.

[BibT_eX]

[DOI]

Proceedings of the Frontiers in Algorithmics - 13th International Workshop, 2019

Improved Algorithms for Ranking and Unranking (k, m)-Ary Trees.

[BibT_eX]

[DOI]

Proceedings of the Algorithmic Aspects in Information and Management, 2019

2018

Realizing Exchanged Crossed Cube Communication Patterns on Linear Array WDM Optical Networks.

[BibT_eX]

[DOI]

Yu-Liang Liu

Int. J. Found. Comput. Sci., 2018

Cycle Embedding in Generalized Recursive Circulant Graphs.

[BibT_eX]

[DOI]

IEICE Trans. Inf. Syst., 2018

The Component Connectivity of Alternating Group Graphs and Split-Stars.

[BibT_eX]

[DOI]

CoRR, 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

Constructing Independent Spanning Trees on Bubble-Sort Networks.

[BibT_eX]

[DOI]

Proceedings of the Computing and Combinatorics - 24th International Conference, 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]

Ting-Jyun Yang

Discret. Appl. Math., 2017

A Constant Amortized Time Algorithm for Generating Left-Child Sequences in Lexicographic Order.

[BibT_eX]

[DOI]

Proceedings of the Frontiers in Algorithmics - 11th International Workshop, 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

Constructing two completely independent spanning trees in hypercube-variant networks.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2016

Vertex-transitivity on folded crossed cubes.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2016

Locally exchanged twisted cubes: Connectivity and super connectivity.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2016

Gray-Code Ranking and Unranking on Left-Weight Sequences of Binary Trees.

[BibT_eX]

[DOI]

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

Amortized Efficiency of Ranking and Unranking Left-Child Sequences in Lexicographic Order.

[BibT_eX]

[DOI]

Proceedings of the Combinatorial Optimization and Applications, 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

On the Structure of Locally Outerplanar Graphs.

[BibT_eX]

[DOI]

Hung-Lung Wang

Chun-Yu Tseng

IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 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]

Sih-Syuan Luo

Comput. J., 2015

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

[BibT_eX]

[DOI]

Appl. Math. Comput., 2015

An Energy-Aware Random Multi-path Routing Protocol for MANETs.

[BibT_eX]

[DOI]

Proceedings of the 2015 IEEE International Conference on Smart City/SocialCom/SustainCom/DataCom/SC2 2015, 2015

Gray Codes for AT-Free Orders via Antimatroids.

[BibT_eX]

[DOI]

Ton Kloks

Hung-Lung Wang

Proceedings of the Combinatorial Algorithms - 26th International Workshop, 2015

2014

A loopless algorithm for generating multiple binary tree sequences simultaneously.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 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

Queue Layouts of Toroidal Grids.

[BibT_eX]

[DOI]

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

Longest Fault-Free Cycles in Folded Hypercubes with Conditional Faulty Elements.

[BibT_eX]

[DOI]

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

Optimal Independent Spanning Trees on Cartesian Product of Hybrid Graphs.

[BibT_eX]

[DOI]

Comput. J., 2014

Some Results of Incidence Coloring on Generalized Petersen Graphs.

[BibT_eX]

[DOI]

Proceedings of the Intelligent Systems and Applications, 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

2013

Power Domination in Honeycomb Meshes.

[BibT_eX]

[DOI]

J. Inf. Sci. Eng., 2013

Ranking and Unranking of Non-regular Trees in Gray-Code Order.

[BibT_eX]

[DOI]

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

Ranking and Unranking t-ary Trees in a Gray-Code Order.

[BibT_eX]

[DOI]

Comput. J., 2013

2011

Amortized efficiency of generating planar paths in convex position.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2011

Ranking and unranking of non-regular trees with a prescribed branching sequence.

[BibT_eX]

[DOI]

Chir-Ho Chang

Math. Comput. Model., 2011

Ranking and Unranking of t-Ary Trees Using RD-Sequences.

[BibT_eX]

[DOI]

IEICE Trans. Inf. Syst., 2011

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

[BibT_eX]

[DOI]

Hung-Chang Chan

Discret. Appl. Math., 2011

A Quadratic Algorithm for Finding Next-to-Shortest Paths in Graphs.

[BibT_eX]

[DOI]

Algorithmica, 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]

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(2M, 2).

[BibT_eX]

[DOI]

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

Erratum to "A new upper bound on the queuenumber of hypercubes" [Discrete Mathematics 310 (2010) 935-939].

[BibT_eX]

[DOI]

Discret. Math., 2010

A new upper bound on the queuenumber of hypercubes.

[BibT_eX]

[DOI]

Discret. Math., 2010

Restricted power domination and fault-tolerant power domination on grids.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2010

Loopless Generation of Non-regular Trees with a Prescribed Branching Sequence.

[BibT_eX]

[DOI]

Comput. J., 2010

2009

On the independent spanning trees of recursive circulant graphs G(cdm, d) with d>2.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2009

Upper bounds on the queuenumber of k-ary n-cubes.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2009

On the diameter of geometric path graphs of points in convex position.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2009

The Interchange Graphs of Tournaments with Minimum Score Vectors Are Exactly Hypercubes.

[BibT_eX]

[DOI]

An-Hang Chen

Graphs Comb., 2009

Geodesic-pancyclicity and fault-tolerant panconnectivity of augmented cubes.

[BibT_eX]

[DOI]

Appl. Math. Comput., 2009

Independent Spanning Trees on Folded Hypercubes.

[BibT_eX]

[DOI]

Hung Chan

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

A Developed Restricted Rotation for Binary Trees Transformation.

[BibT_eX]

[DOI]

Chir-Ho Chang

Proceedings of the 9th International Conference on Hybrid Intelligent Systems (HIS 2009), 2009

2008

A Note on "An improved upper bound on the queuenumber of the hypercube".

[BibT_eX]

[DOI]

Inf. Process. Lett., 2008

The existence and uniqueness of strong kings in tournaments.

[BibT_eX]

[DOI]

Discret. Math., 2008

Fault-tolerant cycle-embedding in alternating group graphs.

[BibT_eX]

[DOI]

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

Geodesic-pancyclic graphs.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2007

2006

A linear time algorithm for binary tree sequences transformation using left-arm and right-arm rotations.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2006

The lower and upper forcing geodetic numbers of block-cactus graphs.

[BibT_eX]

[DOI]

Fu-Hsing Wang

Eur. J. Oper. Res., 2006

A Sufficient Condition for Quasi-Claw-Free Hamiltonian Graphs.

[BibT_eX]

An-Hang Chen

Ars Comb., 2006

2005

An efficient distributed algorithm for finding all hinge vertices in networks.

[BibT_eX]

[DOI]

Ting-Yem Ho

Int. J. Comput. Math., 2005

An efficient algorithm for estimating rotation distance between two binary trees.

[BibT_eX]

[DOI]

Yen-Ju Chen

Int. J. Comput. Math., 2005

2004

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

[BibT_eX]

[DOI]

Networks, 2004

Feedback vertex sets in star graphs.

[BibT_eX]

[DOI]

Fu-Hsing Wang

Inf. Process. Lett., 2004

2003

Distributed algorithms for finding the unique minimum distance dominating set in directed split-stars.

[BibT_eX]

[DOI]

J. Parallel Distributed Comput., 2003

Sorting a sequence of strong kings in a tournament.

[BibT_eX]

[DOI]

Ting-Yem Ho

Inf. Process. Lett., 2003

Induced matchings in asteroidal triple-free graphs.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2003

Powers of Asteroidal Triple-free Graphs with Applications.

[BibT_eX]

Ming-Tat Ko

Ars Comb., 2003

2000

On the powers of graphs with bounded asteroidal number.

[BibT_eX]

[DOI]

Ting-Yem Ho

Discret. Math., 2000

1999

Solving the All-Pairs-Shortest-Lengt Problem on Chordal Bipartite Graphs.

[BibT_eX]

[DOI]

Inf. Process. Lett., 1999

LexBFS-Ordering in Asteroidal Triple-Free Graphs.

[BibT_eX]

[DOI]

Ming-Tat Ko

Proceedings of the Algorithms and Computation, 10th International Symposium, 1999

1998

The Recognition of Geodetically Connected Graphs.

[BibT_eX]

[DOI]