On the Approximability of the Maximum Common Subgraph Problem Viggo Kann Department of Numerical Analysis and Computing Science Royal Institute of Technology SStockholm - Numerical analysis - Document - PDFSEARCH.IO

First Page	Meta Content
	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 Document Date: 2006-06-03 18:31:12 Open Document File Size: 300,37 KB Share Result on Facebook

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 List