The following pages link to Chiun-Chieh Hsu (Q656592):
Displaying 17 items.
- Independent spanning trees vs. edge-disjoint spanning trees in locally twisted cubes (Q656593) (← links)
- An efficient algorithm for minimum feedback vertex sets in rotator graphs (Q987789) (← links)
- Heuristic task assignment for distributed computing systems (Q1187210) (← links)
- Distributed task assignment using critical path estimate (Q1310961) (← links)
- On the fault-tolerant embedding of complete binary trees in the pancake graph interconnection network (Q1582646) (← links)
- On the fault-tolerant embeddings of complete binary trees in the mesh interconnection networks (Q1810462) (← links)
- The co-secure domination in proper interval graphs (Q2078841) (← links)
- Constructing dual-CISTs of folded divide-and-swap cubes (Q2219061) (← links)
- Task assignment in distributed computing systems (Q3348381) (← links)
- Feedback Vertex Sets in Rotator Graphs (Q3603042) (← links)
- Efficient Method to Perform Isomorphism Testing of Labeled Graphs (Q3603080) (← links)
- (Q4302972) (← links)
- Task scheduling with precedence constraints to minimize the total completion time (Q4859027) (← links)
- A two-pass approach for optimally assigning linear tasks to multiprocessor systems (Q4895708) (← links)
- MINIMUM FEEDBACK ARC SETS IN ROTATOR AND INCOMPLETE ROTATOR GRAPHS (Q4902886) (← links)
- The 2-rainbow bondage number in generalized Petersen graphs (Q5193416) (← links)
- The Outer-Paired Domination of Graphs (Q6114861) (← links)
