![](https://www.pdfsearch.io/img/b17f5fac27d6ea0072a8f4143cb4fe74.jpg) Date: 2006-06-03 18:31:12
| | On the Approximability of the Maximum Common Subgraph Problem Viggo Kann Department of Numerical Analysis and Computing Science Royal Institute of Technology SStockholmAdd to Reading ListSource URL: www.nada.kth.seDownload Document from Source Website File Size: 300,37 KBShare Document on Facebook
|