The following pages link to Ming-Shing Yu (Q685474):
Displaying 6 items.
- An O(\(n\)) time algorithm for maximum matching on cographs (Q685476) (← links)
- An optimal parallel algorithm for the domatic partition problem on an interval graph given its sorted model (Q1195857) (← links)
- Sequential and parallel algorithms for the maximum-weight independent set problem on permutation graphs (Q1210310) (← links)
- An optimal parallel algorithm for node ranking of cographs (Q1270781) (← links)
- A simple optimal parallel algorithm for the minimum coloring problem on interval graphs (Q1313723) (← links)
- A linear time algorithm for the maximum matching problem on cographs (Q1314631) (← links)
