The following pages link to Chuan Yi Tang (Q286980):
Displaying 50 items.
- (Q198735) (redirect page) (← links)
- A linear-time algorithm for the weighted feedback vertex problem on interval graphs (Q286981) (← links)
- An efficient algorithm for the length-constrained heaviest path problem on a tree (Q294615) (← links)
- A \(2\cdot | E |\)-bit distributed algorithm for the directed Euler trail problem (Q685488) (← links)
- The full Steiner tree problem (Q702772) (← links)
- Optimal speeding up of parallel algorithms based upon the divide-and- conquer strategy (Q760204) (← links)
- Balancing minimum spanning trees and multiple-source minimum routing cost spanning trees on metric graphs (Q845678) (← links)
- (Q916390) (redirect page) (← links)
- An optimal algorithm for constructing oriented Voronoi diagrams and geograph neighborhood graphs (Q916391) (← links)
- An improved algorithm for finding a length-constrained maximum-density subtree in a tree (Q975556) (← links)
- An improved algorithm for sorting by block-interchanges based on permutation groups (Q991802) (← links)
- A fast algorithm for the alpha-connected two-center decision problem (Q1007526) (← links)
- (Q1041752) (redirect page) (← links)
- An improved algorithm for the maximum agreement subtree problem (Q1041753) (← links)
- Computing the optimal IO sequences of a protocol in polynomial time (Q1183459) (← links)
- Solving the single step graph searching problem by solving the maximum two-independent set problem (Q1183488) (← links)
- Solving the Euclidean bottleneck matching problem by \(k\)-relative neighborhood graphs (Q1194341) (← links)
- Solving the Euclidean bottleneck biconnected edge subgraph problem by 2- relative neighborhood graphs (Q1199461) (← links)
- An efficient algorithm for finding a maximum weight 2-independent set on interval graphs (Q1199945) (← links)
- Solving the weighted efficient edge domination problem on bipartite permutation graphs (Q1270782) (← links)
- Approximation and exact algorithms for constructing minimum ultrametric trees from distance matrices (Q1306399) (← links)
- The summation and bottleneck minimization for single-step searching on weighted graphs (Q1310944) (← links)
- The competitiveness of randomized algorithms for on-line Steiner tree and on-line spanning tree problems (Q1313740) (← links)
- Average performance of a greedy algorithm for the on-line minimum matching problem on Euclidean space (Q1336762) (← links)
- Weighted efficient domination problem on some perfect graphs (Q1348388) (← links)
- Efficient minus and signed domination in graphs (Q1399996) (← links)
- Approximation algorithms for some optimum communication spanning tree problems (Q1566575) (← links)
- Approximation algorithms for the shortest total path length spanning tree problem (Q1582085) (← links)
- Guarding in a simple polygon (Q1607056) (← links)
- An efficient external sorting algorithm (Q1607058) (← links)
- Perfect edge domination and efficient edge domination in graphs (Q1613347) (← links)
- Single step searching in weighted block graphs (Q1894239) (← links)
- An average case analysis of a greedy algorithm for the on-line Steiner tree problem (Q1921250) (← links)
- Efficient algorithms for regular expression constrained sequence alignment (Q2379980) (← links)
- Constrained sequence alignment: A general model and the hardness results (Q2462385) (← links)
- On the Full and Bottleneck Full Steiner Tree Problems (Q3082919) (← links)
- The Bottleneck Tree Alignment Problems (Q3600141) (← links)
- 20‐relative neighborhood graphs are hamiltonian (Q3984463) (← links)
- COVERING CONVEX RECTILINEAR POLYGONS IN LINEAR TIME (Q3986399) (← links)
- (Q4201930) (← links)
- (Q4218431) (← links)
- (Q4218433) (← links)
- EFFICIENT EMULATIONS FOR X-TREES AND /w-ARY TREES* (Q4226499) (← links)
- (Q4250159) (← links)
- (Q4472497) (← links)
- Embedding cycles and meshes onto incomplete hypercubes (Q4498114) (← links)
- A Polynomial Time Approximation Scheme for Optimal Product-Requirement Communication Spanning Trees (Q4500852) (← links)
- Light graphs with small routing cost (Q4537619) (← links)
- (Q4551373) (← links)
- (Q4808628) (← links)