Chongkye Rhee

According to our database, Chongkye Rhee authored at least 7 papers between 1993 and 1998.

Collaborative distances:

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

1998

On the Chromatic Index of Graphs with 2<i>m</i> + 1 Vertices and 2<i>m</i>² Edges.

Chongkye Rhee

Inf. Process. Lett., 1998

1996

An NC Algorithm for the Clique Cover Problem in Cocomparability Graphs and its Application.

Chongkye Rhee, Y. Daniel Liang

Inf. Process. Lett., 1996

Finding Biconnected Components in O(n) Time for a Class of Graphs.

Y. Daniel Liang, Chongkye Rhee

Inf. Process. Lett., 1996

1995

Finding a Maximum Matching in a Permutation Graph.

Chongkye Rhee, Y. Daniel Liang

Acta Informatica, 1995

An Optimal Algorithm for Finding Biconnected Components in Permutation Graphs.

Y. Daniel Liang, Chongkye Rhee

Proceedings of the 1995 ACM 23rd Annual Conference on Computer Science, CSC '95, Nashville, TN, USA, February 28, 1995

1994

Linear Algorithms for Two Independent Set Problems in Permutation Graphs.

Y. Daniel Liang, Chongkye Rhee

Proceedings of the ACM 22rd Annual Computer Science Conference on Scaling up: Meeting the Challenge of Complexity in Real-World Computing Applications, 1994

1993

Finding a Maximum Matching in a Circular-Arc Graph.

Y. Daniel Liang, Chongkye Rhee

Inf. Process. Lett., 1993