en:mcp
Differences
This shows you the differences between two versions of the page.
| Next revisionBoth sides next revision | |||
| en:mcp [2012/08/03 16:10] – created moukrim | en:mcp [2012/08/03 16:54] – dangducc | ||
|---|---|---|---|
| Line 18: | Line 18: | ||
| [1] E. Balas and C. Yu. Finding a maximum clique in an arbitary graph. SIAM Journal of Computing, 15: | [1] E. Balas and C. Yu. Finding a maximum clique in an arbitary graph. SIAM Journal of Computing, 15: | ||
| - | [2] D-C. Dang and A. Moukrim. Subgraph extraction and memetic algorithm for the maximul | + | [2] D-C. Dang and A. Moukrim. Subgraph extraction and memetic algorithm for the maximum |
| [3] J. Xue. Edge-maximal triangulated subgraphs and heuristics for the maximum clique problem. Network, 24: | [3] J. Xue. Edge-maximal triangulated subgraphs and heuristics for the maximum clique problem. Network, 24: | ||
| [4] D-C. Dang and A. Moukrim. Subgraph extraction and hybrid metaheuristics for the maximum clique problem. //Under revision// | [4] D-C. Dang and A. Moukrim. Subgraph extraction and hybrid metaheuristics for the maximum clique problem. //Under revision// | ||
Page Tools
en/mcp.txt · Last modified: 2012/08/10 04:00 by dangducc
