T
Ten-Hwang Lai
Researcher at Ohio State University
Publications - 10
Citations - 115
Ten-Hwang Lai is an academic researcher from Ohio State University. The author has contributed to research in topics: Path vector protocol & Graph power. The author has an hindex of 4, co-authored 10 publications receiving 114 citations.
Papers
More filters
Journal ArticleDOI
Performance of parallel branch-and-bound algorithms
Ten-Hwang Lai,Alan P. Sprague +1 more
TL;DR: The authors show the conditions under which anomalies are guaranteed not to occur when the number of processors is doubled, or not even doubled.
Journal ArticleDOI
The complexity of congestion-1 embedding in a hypercube
Young Man Kim,Ten-Hwang Lai +1 more
TL;DR: It is shown that any graph G can be embedded with unit congestion in a hypercube of dimension n ≥ max{6⌈log|V(G)|⌉, deg( G )}, but it is NP-complete to determine whether G is congestion-1 embeddable in a given hypercube, even if the source graph is connected.
Journal ArticleDOI
Bipartite permutation graphs with application to the minimum buffer size problem
Ten-Hwang Lai,Shu-shang Wei +1 more
TL;DR: In this paper, a new characterization of bipartite permutation graphs and a structure theorem for (0, 1)-matrices with a special consecutive 1's property are presented.
Journal ArticleDOI
On the routability of a convex grid
Ten-Hwang Lai,Alan P. Sprague +1 more
TL;DR: It is shown that whether a convex grid can be laid out can be determined in time which is linear in the perimeter of the grid, and the algorithm to accomplish this is incomplete.
Journal ArticleDOI
Algorithms for page retrieval and Hamiltonian paths on forward-convex line graphs
Ten-Hwang Lai,Shu-Shang Wei +1 more
TL;DR: This paper develops an algorithm that solves the problems of determining whether an undirected graph G is sequentially edge-connected, whether G has a dominating path, and whether there is a Hamiltonian path in the line graph of G in O(| E ( G )|) time for forward-convex graphs G.