List of research outcomes
This list is not complete and representing at the moment only items from zbMATH Open and arXiv. We are working on additional sources - please check back here soon!
| Publication | Date of Publication | Type |
|---|---|---|
| On the chromatic index of graphs with \(2m+1\) vertices and \(2m^2\) edges. Information Processing Letters | 2006-01-17 | Paper |
| Finding biconnected components in O(n) time for a class of graphs Information Processing Letters | 1997-02-27 | Paper |
| An NC algorithm for the clique cover problem in cocomparability graphs and its application Information Processing Letters | 1997-02-27 | Paper |
| An $O(N + M)$-Time Algorithm for Finding a Minimum-Weight Dominating Set in a Permutation Graph SIAM Journal on Computing | 1996-11-10 | Paper |
| Finding a maximum matching in a permutation graph Acta Informatica | 1995-11-20 | Paper |
| The minimum weight dominating set problem for permutation graphs is in NC Journal of Parallel and Distributed Computing | 1995-09-24 | Paper |
| Efficient algorithms for finding depth-first and breadth-first search trees in permutation graphs Information Processing Letters | 1994-01-01 | Paper |
| Finding a maximum matching in a circular-arc graph Information Processing Letters | 1993-05-16 | Paper |
Research outcomes over time
This page was built for person: Chongkye Rhee
