The following pages link to Ruay-Shiung Chang (Q290258):
Displaying 18 items.
- Broadcast scheduling in packet radio networks by Hopfield neural networks (Q290259) (← links)
- (Q917430) (redirect page) (← links)
- On the continuous working problem (Q917431) (← links)
- On a scheduling problem where a job can be executed only by a limited number of processors (Q1104235) (← links)
- (Q1183449) (redirect page) (← links)
- Single step graph search problem (Q1183450) (← links)
- Solving the single step graph searching problem by solving the maximum two-independent set problem (Q1183488) (← links)
- An efficient algorithm for finding a maximum weight 2-independent set on interval graphs (Q1199945) (← links)
- The summation and bottleneck minimization for single-step searching on weighted graphs (Q1310944) (← links)
- The minimum labeling spanning trees (Q1567492) (← links)
- Jump number maximization for proper interval graphs and series-parallel graphs (Q1818782) (← links)
- Single step searching in weighted block graphs (Q1894239) (← links)
- Routing with adaptive path and limited flooding for mobile ad hoc networks (Q1957725) (← links)
- Three completely independent spanning trees of crossed cubes with application to secure-protection routing (Q2053847) (← links)
- Improved algorithms for ranking and unranking \((k, m)\)-ary trees in B-order (Q2082174) (← links)
- A well-equalized 3-CIST partition of alternating group graphs (Q2281160) (← links)
- A two-stages tree-searching algorithm for finding three completely independent spanning trees (Q2317871) (← links)
- Constructing three completely independent spanning trees in locally twisted cubes (Q2327090) (← links)
