Meirun Chen

According to our database, Meirun Chen authored at least 21 papers between 2009 and 2024.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of two.

2024

A New Tree Structure for Local Diagnosis.

Meirun Chen, Xiao-Yan Li, Cheng-Kuan Lin, Kung-Jui Pai

J. Inf. Sci. Eng., March, 2024

A tree structure for local diagnosis in multiprocessor systems under the comparison model.

Meirun Chen, Cheng-Kuan Lin, Kung-Jui Pai

Theor. Comput. Sci., 2024

A novel edge connectivity based on edge partition for hypercube and folded hypercube.

Meirun Chen, Michel Habib, Cheng-Kuan Lin

Appl. Math. Comput., 2024

2023

Diagnosability for a family of matching composition networks.

Meirun Chen, Michel Habib, Cheng-Kuan Lin

J. Supercomput., May, 2023

2022

A new structure for a vertex to be locally <i>t</i>-diagnosable in large multiprocessor systems.

Meirun Chen, D. Frank Hsu, Cheng-Kuan Lin

Theor. Comput. Sci., 2022

Connectivity for some families of composition networks.

Hong Chen, Meirun Chen, Michel Habib, Cheng-Kuan Lin

Theor. Comput. Sci., 2022

2021

A New Measure for Locally t-Diagnosable Under PMC Model.

Meirun Chen, D. Frank Hsu, Cheng-Kuan Lin

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

2020

Homomorphisms of partial <i>t</i>-trees and edge-colorings of partial 3-trees.

Meirun Chen, Reza Naserasr

J. Comb. Theory B, 2020

2018

The optimal routing of augmented cubes.

Meirun Chen, Reza Naserasr

Inf. Process. Lett., 2018

Graphs with Almost All Edges in Long Cycles.

Naidan Ji, Meirun Chen

Graphs Comb., 2018

2016

Fault-Tolerant Adaptive Routing in n-D Mesh.

Meirun Chen, Yang Yi

Proceedings of the Web-Age Information Management, 2016

2014

Adaptive Fault-Tolerant Routing in 2D Mesh with Cracky Rectangular Model.

Yang Yi, Meirun Chen, Hao Li, Lian Li

J. Appl. Math., 2014

Total chromatic number of generalized Mycielski graphs.

Meirun Chen, Xiaofeng Guo, Hao Li, Lianzhu Zhang

Discret. Math., 2014

Total and adjacent vertex-distinguishing total chromatic numbers of augmented cubes.

Meirun Chen, Shaohui Zhai

Ars Comb., 2014

2013

Total chromatic number of folded hypercubes.

Meirun Chen, Xiaofeng Guo, Shaohui Zhai

Ars Comb., 2013

2011

The optimal strong radius and optimal strong diameter of the Cartesian product graphs.

Meirun Chen, Xiaofeng Guo, Shaohui Zhai

Appl. Math. Lett., 2011

2010

On Vertex-Distinguishing Proper Edge Colorings of Graphs Satisfying the Ore Condition.

Meirun Chen, Xiaofeng Guo

Ars Comb., 2010

Lower and Upper Orientable Strong Radius and Strong Diameter of the Cartesian Product of Complete Graphs.

Meirun Chen, Xiaofeng Guo

Ars Comb., 2010

2009

On f-fault tolerant arc-forwarding and optical indices of all-optical folded hypercubes.

Meirun Chen, Jianguo Qian

Inf. Process. Lett., 2009

Adjacent vertex-distinguishing edge and total chromatic numbers of hypercubes.

Meirun Chen, Xiaofeng Guo

Inf. Process. Lett., 2009

Lower and upper orientable strong diameters of graphs satisfying the Ore condition.

Meirun Chen, Xiaofeng Guo, Hao Li

Appl. Math. Lett., 2009