Chong Jye Rhee

According to our database, Chong Jye Rhee authored at least 6 papers between 1990 and 1996.

Collaborative distances:

• Dijkstra number of five.
• Erdős number of four.

1996

An O(N+M)-Time Algorithm for Finding a Minimum-Weight Dominating Set in a Permutation Graph.

Chong Jye Rhee, Y. Daniel Liang, Sudarshan K. Dhall, S. Lakshmivarahan

SIAM J. Comput., 1996

1995

The Minimum Weight Dominating Set Problem for Permutation Graphs Is in NC.

Chong Jye Rhee, Sudarshan K. Dhall, S. Lakshmivarahan

J. Parallel Distributed Comput., 1995

1994

Efficient Algorithms for Finding Depth-First and Breadth-First Search Trees in Permutation Graphs.

Chong Jye Rhee, Y. Daniel Liang, Sudarshan K. Dhall, S. Lakshmivarahan

Inf. Process. Lett., 1994

1992

NC algorithms for dominations in permutation graphs.

Y. Daniel Liang, Chong Jye Rhee, Sudarshan K. Dhall, S. Lakshmivarahan

Proceedings of the 1992 ACM/SIGAPP Symposium on Applied Computing: Technological Challenges of the 1990's, 1992

1991

A New Approach for the Domination Problem on Permutation Graphs.

Y. Daniel Liang, Chong Jye Rhee, Sudarshan K. Dhall, S. Lakshmivarahan

Inf. Process. Lett., 1991

1990

An Optimal Parallel Algorithm for the Maximal Element Problem (Abstract).

Chong Jye Rhee, Sudarshan K. Dhall, S. Lakshmivarahan

Proceedings of the ACM 18th Annual Computer Science Conference on Cooperation, 1990