Cheng-Kuan Lin

According to our database1, Cheng-Kuan Lin authored at least 135 papers between 2004 and 2023.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of two.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

On csauthors.net:

Bibliography

2023
The High Faulty Tolerant Capability of the Alternating Group Graphs.
IEEE Trans. Parallel Distributed Syst., 2023

2022
Completely Independent Spanning Trees on BCCC Data Center Networks With an Application to Fault-Tolerant Routing.
IEEE Trans. Parallel Distributed Syst., 2022

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

Connectivity for some families of composition networks.
Theor. Comput. Sci., 2022

Trusted resource allocation based on proof-of-reputation consensus mechanism for edge computing.
Peer-to-Peer Netw. Appl., 2022

The Component Diagnosability of General Networks.
Int. J. Found. Comput. Sci., 2022

A Local Diagnosis Algorithm for Hypercube-like Networks under the BGM Diagnosis Model.
Fundam. Informaticae, 2022

A Conditional Local Diagnosis Algorithm on the Arrangement Graph.
Proceedings of the Innovative Mobile and Internet Services in Ubiquitous Computing - Proceedings of the 16th International Conference on Innovative Mobile and Internet Services in Ubiquitous Computing (IMIS 2022), June 29, 2022

2021
The component connectivity, component diagnosability, and <i>t</i>/<i>k</i>-diagnosability of Bicube networks.
Theor. Comput. Sci., 2021

Note on <i>R</i><sub><i>g</i></sub>-conditional diagnosability of hypercube.
Theor. Comput. Sci., 2021

Super fault-tolerance assessment of locally twisted cubes based on the structure connectivity.
Theor. Comput. Sci., 2021

Reliability Evaluation of Generalized Exchanged Hypercubes Based on Imprecise Diagnosis Strategies.
Parallel Process. Lett., 2021

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

Efficient algorithms for support path with time constraint.
J. Comb. Optim., 2021

Subgraph-based Strong Menger Connectivity of Hypercube and Exchanged Hypercube.
Int. J. Found. Comput. Sci., 2021

An Exchanged 3-Ary n-Cube Interconnection Network for Parallel Computation.
Int. J. Found. Comput. Sci., 2021

Using a heuristic multi-objective genetic algorithm to solve the storage assignment problem for CPS-based pick-and-pass system.
Enterp. Inf. Syst., 2021

Cluster connectivity of hypercube-based networks under the super fault-tolerance condition.
Discret. Appl. Math., 2021

Relationship Between Extra Connectivity And Component Connectivity In Networks.
Comput. J., 2021

On the Neighborhood-Connectivity of Locally Twisted Cube Networks.
Proceedings of the Innovative Mobile and Internet Services in Ubiquitous Computing, 2021

A New Measure for Locally t-Diagnosable Under PMC Model.
Proceedings of the Computing and Combinatorics - 27th International Conference, 2021

2020
Reliability Evaluation of Generalized Exchanged X-Cubes Based on the Condition of g-Good-Neighbor.
Wirel. Commun. Mob. Comput., 2020

A Novel Low Cost Interconnection Architecture Based on the Generalized Hypercube.
IEEE Trans. Parallel Distributed Syst., 2020

Diagnosability for two families of composition networks.
Theor. Comput. Sci., 2020

Reliability analysis of data center networks based on precise and imprecise diagnosis strategies.
Theor. Comput. Sci., 2020

Structure and Substructure Connectivity of Hypercube-Like Networks.
Parallel Process. Lett., 2020

基于地址空间的树型网络地址分配 (Address Assignment Algorithm for Tree Network Based on Address Space).
计算机科学, 2020

Fault-Tolerant Hamiltonicity and Hamiltonian Connectivity of BCube with Various Faulty Elements.
J. Comput. Sci. Technol., 2020

Communication Performance Evaluation of the Locally Twisted Cube.
Int. J. Found. Comput. Sci., 2020

The Conditional-(<i>g</i>, <i>d</i>, <i>k</i>)-Connectivity and Conditional-(<i>g</i>, <i>d</i>, <i>k</i>)-edge-Connectivity on the Hypercubes.
Fundam. Informaticae, 2020

The Diagnosability of (<i>K</i><sub>4</sub> - {<i>e</i>})-free Graphs under the PMC Diagnosis Model.
Fundam. Informaticae, 2020

Constructing Node-Independent Spanning Trees in Augmented Cubes.
Fundam. Informaticae, 2020

An improved algorithm to construct edge-independent spanning trees in augmented cubes.
Discret. Appl. Math., 2020

Effect of Packet Loss and Delay on V2X Data Fusion.
Proceedings of the 21st Asia-Pacific Network Operations and Management Symposium, 2020

2019
An efficient algorithm for embedding exchanged hypercubes into grids.
J. Supercomput., 2019

The extra connectivity, extra conditional diagnosability and <i>t</i>/<i>k</i>-diagnosability of the data center network DCell.
Theor. Comput. Sci., 2019

Constructing node-independent spanning trees on the line graph of the hypercube by an independent forest scheme.
J. Parallel Distributed Comput., 2019

A Cost-Efficient Approach to Storing Users' Data for Online Social Networks.
J. Comput. Sci. Technol., 2019

Optimally Embedding 3-Ary n-Cubes into Grids.
J. Comput. Sci. Technol., 2019

The diagnosability and 1-good-neighbor conditional diagnosability of hypercubes with missing links and broken-down nodes.
Inf. Process. Lett., 2019

Structure Fault-Tolerance of the Generalized Hypercube.
Comput. J., 2019

Vertex-Disjoint Paths in the Generalized Hypercube under 1-Restricted Connectivity.
Proceedings of the 21st IEEE International Conference on High Performance Computing and Communications; 17th IEEE International Conference on Smart City; 5th IEEE International Conference on Data Science and Systems, 2019

ID-Free Multigroup Cardinality Estimation for Massive RFID Tags in IoT.
Proceedings of the IEEE VTS Asia Pacific Wireless Communications Symposium, 2019

2018
Hamiltonian cycle and path embeddings in 3-ary n-cubes based on K1, 3-structure faults.
J. Parallel Distributed Comput., 2018

BCDC: A High-Performance, Server-Centric Data Center Network.
J. Comput. Sci. Technol., 2018

Structure connectivity and substructure connectivity of <i>k</i>-ary <i>n</i>-cube networks.
Inf. Sci., 2018

Diagnosability Evaluation of the Data Center Network DCell.
Comput. J., 2018

A Diagnosis Algorithm on the 2D-torus Network.
Proceedings of the Innovative Mobile and Internet Services in Ubiquitous Computing, 2018

Fault Diagnosis Algorithm for WSN Based on Clustering and Credibility.
Proceedings of the Algorithms and Architectures for Parallel Processing, 2018

Embedding Exchanged Hypercubes into Rings and Ladders.
Proceedings of the Algorithms and Architectures for Parallel Processing, 2018

2017
Strong Fault-Hamiltonicity for the Crossed Cube and Its Extensions.
Parallel Process. Lett., 2017

基于顶点度数的完全独立生成树研究 (Research on Completely Independent Spanning Trees Based on Degree of Vertices).
计算机科学, 2017

基于有故障区域的Mesh网络目标结点间的最短路由算法 (Shortest Routing Algorithm Based on Target Node in Mesh Network with Faulty Area).
计算机科学, 2017

Optimal Path Embedding in the Exchanged Crossed Cube.
J. Comput. Sci. Technol., 2017

Combinatorial analysis of the subsystem reliability of the split-star network.
Inf. Sci., 2017

Cycles Embedding in Exchanged Crossed Cube.
Int. J. Found. Comput. Sci., 2017

A Fault-Free Unicast Algorithm in the Generalized Hypercube with Restricted Faulty Vertices.
Int. J. Found. Comput. Sci., 2017

Privacy preserving method based on Voronoi diagram in mobile crowd computing.
Int. J. Distributed Sens. Networks, 2017

Hamiltonian Cycle and Path Embeddings in k-Ary n-Cubes Based on Structure Faults.
Comput. J., 2017

Parallel and local diagnostic algorithm for wireless sensor networks.
Proceedings of the 19th Asia-Pacific Network Operations and Management Symposium, 2017

2016
An efficient algorithm to construct disjoint path covers of DCell networks.
Theor. Comput. Sci., 2016

Structure connectivity and substructure connectivity of hypercubes.
Theor. Comput. Sci., 2016

Vertex-disjoint paths in DCell networks.
J. Parallel Distributed Comput., 2016

A localized fault detection algorithm for mobility management in the strongly <i>t</i>-diagnosable wireless ad hoc network under the comparison model.
EURASIP J. Wirel. Commun. Netw., 2016

The restricted h-connectivity of the data center network DCell.
Discret. Appl. Math., 2016

Hamiltonian Cycle and Path Embeddings in 3-Ary n-Cubes Based on K1, 2-Structure Faults.
Proceedings of the 2016 IEEE Trustcom/BigDataSE/ISPA, 2016

A Framework of Cycle-Based Clustering on the Crossed Cube Architecture.
Proceedings of the 10th International Conference on Innovative Mobile and Internet Services in Ubiquitous Computing, 2016

Support path with time constraint in wireless sensor networks.
Proceedings of the 18th Asia-Pacific Network Operations and Management Symposium, 2016

2015
Diagnosability and Diagnostic Algorithm for Pancake Graph under the Comparison Model.
J. Interconnect. Networks, 2015

Conditional Matching Preclusion For The Star Graphs.
Ars Comb., 2015

The Minimal Exposure Path in Mobile Wireless Sensor Network.
Proceedings of the Seventh International Symposium on Parallel Architectures, 2015

Dynamic Reconfiguration of Complete Binary Trees in Faulty Locally Twisted Cubes.
Proceedings of the 11th International Conference on Mobile Ad-hoc and Sensor Networks, 2015

One-to-One Disjoint Path Covers on Mesh.
Proceedings of the Algorithms and Architectures for Parallel Processing, 2015

2014
The diagnosability of triangle-free graphs.
Theor. Comput. Sci., 2014

A Linear Time Pessimistic Diagnosis Algorithm for Hypermesh Multiprocessor Systems under the PMC Model.
IEEE Trans. Computers, 2014

On the maximum number of fault-free mutually independent Hamiltonian cycles in the faulty hypercube.
J. Comb. Optim., 2014

Fault-tolerant hamiltonian connectivity of the WK-recursive networks.
Inf. Sci., 2014

Conditional Fault Hamiltonicity of the Star Graph.
Ars Comb., 2014

A test round controllable local diagnosis algorithm under the PMC diagnosis model.
Appl. Math. Comput., 2014

A D2D relative positioning system on smart devices.
Proceedings of the IEEE Wireless Communications and Networking Conference, 2014

A model based on crossed cubes for VoD services.
Proceedings of the 2nd International Conference on Systems and Informatics, 2014

Distributed address assignment with address borrowing for ZigBee networks.
Proceedings of the IEEE International Conference on Communications, 2014

PTAS for Minimum k-Path Connected Vertex Cover in Growth-Bounded Graphs.
Proceedings of the Algorithms and Architectures for Parallel Processing, 2014

Conditional Connectivity with Distance Requirement on Hypercube.
Proceedings of the 17th IEEE International Conference on Computational Science and Engineering, 2014

2013
Local Diagnosis Algorithms for Multiprocessor Systems Under the Comparison Diagnosis Model.
IEEE Trans. Reliab., 2013

An Algorithmic Approach to Conditional-Fault Local Diagnosis of Regular Multiprocessor Interconnected Systems under the PMC Model.
IEEE Trans. Computers, 2013

4-ordered-Hamiltonian problems of the generalized Petersen graph <i>GP</i>(<i>n</i>, 4).
Math. Comput. Model., 2013

Disjoint cycles in hypercubes with prescribed vertices in each cycle.
Discret. Appl. Math., 2013

The spanning laceability on the faulty bipartite hypercube-like networks.
Appl. Math. Comput., 2013

Automatic parameter selection for the ZigBee distributed address assignment mechanism.
Proceedings of the 24th IEEE Annual International Symposium on Personal, 2013

2012
Component connectivity of the hypercubes.
Int. J. Comput. Math., 2012

Solution to an open problem on 4-ordered Hamiltonian graphs.
Discret. Math., 2012

Mutually Independent Hamiltonian Cycles in Some Graphs.
Ars Comb., 2012

Super Spanning Connectivity of Augmented Cubes.
Ars Comb., 2012

Pancyclicity, Panconnectivity, and Panpositionability for General Graphs and Bipartite Graphs.
Ars Comb., 2012

The g-good-neighbor conditional diagnosability of hypercube under PMC model.
Appl. Math. Comput., 2012

Identifying Restricted-Faults in Multiprocessor Meshes under the PMC Diagnostic Model.
Proceedings of the Sixth International Conference on Innovative Mobile and Internet Services in Ubiquitous Computing, 2012

2011
Conditional-Fault Diagnosability of Multiprocessor Systems with an Efficient Local Diagnosis Algorithm under the PMC Model.
IEEE Trans. Parallel Distributed Syst., 2011

On the Extremal Number of Edges in Hamiltonian Graphs.
J. Inf. Sci. Eng., 2011

Fault-free mutually independent Hamiltonian cycles of faulty star graphs.
Int. J. Comput. Math., 2011

Embedding Cycles into Hypercubes with Prescribe Vertices in the Specific Order.
Proceedings of the 14th IEEE International Conference on Computational Science and Engineering, 2011

2010
4-Ordered Hamiltonicity for Some Chordal Ring Graphs.
J. Interconnect. Networks, 2010

On the Existence of Disjoint Spanning Paths in Faulty Hypercubes.
J. Interconnect. Networks, 2010

The construction of mutually independent Hamiltonian cycles in bubble-sort graphs.
Int. J. Comput. Math., 2010

On the extremal number of edges in hamiltonian connected graphs.
Appl. Math. Lett., 2010

The Diagnosability of g-good-neighbor Conditional-Faulty Hypercube under PMC Model.
Proceedings of the International Conference on Parallel and Distributed Processing Techniques and Applications, 2010

2009
The super spanning connectivity and super spanning laceability of the enhanced hypercubes.
J. Supercomput., 2009

On the bipanpositionable bipanconnectedness of hypercubes.
Theor. Comput. Sci., 2009

Embedding paths of variable lengths into hypercubes with conditional link-faults.
Parallel Comput., 2009

Fault-Tolerant Hamiltonian laceability and Fault-Tolerant Conditional Hamiltonian for Bipartite Hypercube-like Networks.
J. Interconnect. Networks, 2009

A New Isomorphic Definition of the Crossed Cube and its Spanning Connectivity.
J. Interconnect. Networks, 2009

Fault Diameter of Hypercubes with Hybrid Node and Link Faults.
J. Interconnect. Networks, 2009

Fault-Tolerant Hamiltonian Connectivity and Fault-Tolerant Hamiltonicity of the Fully Connected Cubic Networks.
J. Inf. Sci. Eng., 2009

A note on fault-free mutually independent Hamiltonian cycles in hypercubes with faulty edges.
J. Comb. Optim., 2009

Fault-tolerant hamiltonicity and fault-tolerant hamiltonian connectivity of the folded Petersen cube networks.
Int. J. Comput. Math., 2009

Mutually independent hamiltonian cycles for the pancake graphs and the star graphs.
Discret. Math., 2009

On the spanning fan-connectivity of graphs.
Discret. Appl. Math., 2009

The bipanpositionable bipancyclic property of the hypercube.
Comput. Math. Appl., 2009

Mutually orthogonal hamiltonian connected graphs.
Appl. Math. Lett., 2009

Fault-Tolerant Hamiltonicity of the WK-Recursive Networks.
Proceedings of the 10th International Symposium on Pervasive Systems, 2009

2008
Conditional Diagnosability of Cayley Graphs Generated by Transposition Trees under the Comparison Diagnosis Model.
J. Interconnect. Networks, 2008

On spanning connected graphs.
Discret. Math., 2008

Fault-tolerant hamiltonian connectedness of cycle composition networks.
Appl. Math. Comput., 2008

Mutually Independent Hamiltonianicity of Pancake Graphs and Star Graphs.
Proceedings of the 9th International Symposium on Parallel Architectures, 2008

2007
On the spanning connectivity and spanning laceability of hypercube-like networks.
Theor. Comput. Sci., 2007

On the spanning connectivity of graphs.
Discret. Math., 2007

2006
On the spanning <i>w</i>-wide diameter of the star graph.
Networks, 2006

Mutually Independent Hamiltonian Paths and Cycles in Hypercubes.
J. Interconnect. Networks, 2006

The Spanning Connectivity of the (n, k)-star Graphs.
Int. J. Found. Comput. Sci., 2006

Panpositionable Hamiltonian Graphs.
Ars Comb., 2006

2005
The super connectivity of the pancake graphs and the super laceability of the star graphs.
Theor. Comput. Sci., 2005

Mutually independent hamiltonian paths in star networks.
Networks, 2005

Mutually Independent Hamiltonian Cycles in Hypercubes.
Proceedings of the 8th International Symposium on Parallel Architectures, 2005

2004
The super laceability of the hypercubes.
Inf. Process. Lett., 2004

The Spanning Diameter of the Star Graphs.
Proceedings of the 7th International Symposium on Parallel Architectures, 2004


  Loading...