The following pages link to Hong-Chun Hsu (Q454913):
Displaying 12 items.
- A fast fault-identification algorithm for bijective connection graphs using the PMC model (Q454914) (← links)
- A dynamic programming algorithm for simulation of a multi-dimensional torus in a crossed cube (Q621616) (← links)
- Geodesic pancyclicity and balanced pancyclicity of augmented cubes (Q845936) (← links)
- The two-equal-disjoint path cover problem of matching composition network (Q963388) (← links)
- A class of hierarchical graphs as topologies for interconnection networks (Q982664) (← links)
- Ring embedding in faulty pancake graphs (Q1007619) (← links)
- Globally bi-3*-connected graphs (Q1025446) (← links)
- Constructing the nearly shortest path in crossed cubes (Q2390375) (← links)
- Fault Hamiltonicity and fault Hamiltonian connectivity of the (n,k)-star graphs (Q4446910) (← links)
- A Linear Time Pessimistic Diagnosis Algorithm for Hypermesh Multiprocessor Systems under the PMC Model (Q5267308) (← links)
- THE SPANNING CONNECTIVITY OF THE (n,k)-STAR GRAPHS (Q5291305) (← links)
- An Efficient Algorithm for Embedding Two-Dimensional Tori into Balanced Hypercubes (Q6135724) (← links)