![]() | ![]() |
Ask others: ACM DL/Guide -
- CSB - MetaPress - Google - Bing - Yahoo
| 1 | Egon Balas, Chang Sung Yu: Finding a Maximum Clique in an Arbitrary Graph. SIAM J. Comput. 15(4): 1054-1068 (1986) |
Selection of 1 from 1 records - Chang Sung Yu has 1 coauthors
Last update 2012-02-15 CET by the DBLP Team —
Content released under the ODC-BY 1.0 license — See also our legal information page