External Links

Cite Key

Statistics

  • References: 0
  • Cited by: 0
  • Reviews: 0
  • Bibliographies: 1

PDF

Bibliographies

    Researchr

    Researchr is a web site for finding, collecting, sharing, and reviewing scientific publications, for researchers by researchers.

    Sign up for an account to create a profile with publication list, tag and review your related work, and share bibliographies with your co-authors.

    On the Approximability of the Maximum Common Subgraph Problem

    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.

    Abstract

    Abstract is missing.

    runs on