The Algorithm Design Manual
About the Book
Programming Challenges

The Stony Brook Algorithm Repository

Steven Skiena
Stony Brook University
Dept. of Computer Science

GMT - Graph Matching Toolkit

GMT is a collection of C++ classes for respresentation of attributed graphs and various algorithms for exact and error-correcting subgraph isomorphism detection. This toolkit aims at providing students, researchers and application programmers with an implementation of conevtional and new methods for attributed graph matching.
In Particular, the toolkit supports the following operations:

All of the classes in the toolkit are designed such that they can either be incorporated into a standalone application or split up into a client/server system where the graph matching component is run as a server providing clients with the above services.
  • Download Files (local site)
  • Graph Matching Toolkit by Prof. Bunke

    Problem Links

    Graph Isomorphism (5)
    Clique (4)
    Independent Set (4)
    Shape Similarity (4)

    This page last modified on 2008-07-10 .