Viggo Kann. On the Approximability of the Maximum Common Subgraph Problem. In Alain Finkel, Matthias Jantzen, editors, STACS 92, 9th Annual Symposium on Theoretical Aspects of Computer Science, Cachan, France, February 13-15, 1992, Proceedings. Volume 577 of Lecture Notes in Computer Science, pages 377-388, Springer, 1992.
No references recorded for this publication.
No citations of this publication recorded.