Kung-Jui Pai

J. Parallel Distributed Comput., January, 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

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

[BibT_eX]

[DOI]

IEEE Trans. Netw. Sci. Eng., 2022

Constructing tri-CISTs in shuffle-cubes.

[BibT_eX]

[DOI]

J. Comb. Optim., 2022

A Tree Structure for Local Diagnosis in Multiprocessor Systems Under Comparison Model.

[BibT_eX]

[DOI]

Meirun Chen

Cheng-Kuan Lin

Proceedings of the New Trends in Computer Technologies and Applications, 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

Embedding Three Edge-Disjoint Hamiltonian Cycles into Locally Twisted Cubes.

[BibT_eX]

[DOI]

Proceedings of the Computing and Combinatorics - 27th International Conference, 2021

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

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

[BibT_eX]

[DOI]

Discret. Appl. Math., 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

A Parallel Algorithm for Constructing Two Edge-Disjoint Hamiltonian Cycles in Crossed Cubes.

[BibT_eX]

[DOI]

Proceedings of the Algorithmic Aspects in Information and Management, 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 Three Completely Independent Spanning Trees in Locally Twisted Cubes.

[BibT_eX]

[DOI]

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

2018

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

[BibT_eX]

[DOI]

Comput. J., 2018

Designing an Algorithm to Improve the Diameters of Completely Independent Spanning Trees in Crossed Cubes.

[BibT_eX]

[DOI]

Proceedings of the New Trends in Computer Technologies and Applications, 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

A note on path embedding in crossed cubes with faulty vertices.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2017

Completely Independent Spanning Trees on 4-Regular Chordal Rings.

[BibT_eX]

[DOI]

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

On the Orbits of Crossed Cubes.

[BibT_eX]

[DOI]

Tzong-Huei Shiau

CoRR, 2017

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

[BibT_eX]

[DOI]

Ro-Yu Wu

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]

Jinn-Shyong Yang

Inf. Process. Lett., 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

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

Some Results of Incidence Coloring on Generalized Petersen Graphs.

[BibT_eX]

[DOI]

Proceedings of the Intelligent Systems and Applications, 2014

2011

Amortized efficiency of generating planar paths in convex position.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2011

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

2009

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

[BibT_eX]

[DOI]

Inf. Process. Lett., 2009

2008

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

[BibT_eX]

[DOI]