On the Approximability of the Maximum Common Subgraph Problem Viggo Kann Department of Numerical Analysis and Computing Science Royal Institute of Technology SStockholm

First Page		Document Content
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 SStockholm Add to Reading List Source URL: www.nada.kth.se Download Document from Source Website File Size: 300,37 KB Share Document on Facebook