scispace - formally typeset
C

Chuan Yi Tang

Researcher at Providence College

Publications -  227
Citations -  17163

Chuan Yi Tang is an academic researcher from Providence College. The author has contributed to research in topics: Minimum spanning tree & K-ary tree. The author has an hindex of 29, co-authored 227 publications receiving 16901 citations. Previous affiliations of Chuan Yi Tang include China Medical University (Taiwan) & Cadence Design Systems.

Papers
More filters
Journal ArticleDOI

A 2dvEv- bit distributed algorithm for the directed Euler trail problem

TL;DR: The algorithm can be used as a building block for solving other distributed graph problems, and can be slightly modified to run on a strongly-connected diagraph for generating the existent Euler trail or to report that no Euler trails exist.
Proceedings ArticleDOI

A polynomial time approximation scheme for minimum routing cost spanning trees

TL;DR: It is shown how to build a spanning tree of an n-vertex weighted graph with routing cost at most $(1+\epsilon)$ of the minimum in time $O(n^{O({\frac{1}{\Epsilon}}% )})$ and present a polynomial-time approximation scheme valid for both versions of the problem.
Journal ArticleDOI

A Novel Molecular Signature Identified by Systems Genetics Approach Predicts Prognosis in Oral Squamous Cell Carcinoma

TL;DR: This study identified a candidate molecular signature associated with poor prognosis in OSCC patients, which may ultimately facilitate patient-tailored selection of therapeutic strategies.
Journal ArticleDOI

Whole-genome sequencing and identification of Morganella morganii KT pathogenicity-related genes

TL;DR: In this paper, the authors used Illumina technology to sequence the genome of the KT strain of M. morganii and compared its sequence with the genome sequences of related bacteria, which revealed pathogenicity-related genes and novel genes not found in other members of Proteeae.
Journal ArticleDOI

A Polynomial-Time Approximation Scheme for Minimum Routing Cost Spanning Trees

TL;DR: In this paper, the authors showed that the problem of finding a spanning tree with minimum routing cost is NP-hard, even when the costs obey the triangle inequality, and that the general case is in fact reducible to the metric case and presented a polynomial time approximation scheme valid for both versions of the problem.