Statistics
Publications
2
Citations
412
H-Index
2
Active since
1986
Affiliations
U.S. National Science Foundation(Current)
Chang Sung Yu is an author at U.S. National Science Foundation specializing in computational complexity of graph algorithms, mathematics, and clique algorithms.
Publications per year
1986–1989
2
2
Finding a Maximum Clique in an Arbitrary Graph
Egon Balas, Chang Sung Yu · SIAM Journal on Computing · 1986 · 293 citations
On graphs with polynomially solvable maximum‐weight clique problem
Egon Balas, Chang Sung Yu · Networks · 1989 · 119 citations
1–2 of 2