1. Borndörfer, R. (1997). Aspects of set packing, partitioning, and covering. Ph.D. thesis, Mathematics Department, Technischen Universität, Berlin.
2. Chen, L., & Robien, W. (1994). Application of the maximal common substructure algorithm to automatic interpretation of 13C NMR spectra. Journal of Chemical Information and Computer Sciences, 34, 934–941.
3. Conte, D., Guidobaldi, C., & Sansone, C. (2003). A comparison of three maximum common subgraph algorithms on a large database of labeled graphs. In Lecture notes in computer science (Vol. 2726, pp. 130–141). Berlin: Springer.
4. Edmonds, M. (1975). Private communication (4.2.2; a1.4)
5. Falkenhainer, B., Forbus, K., & Gentner, D. (1989/1990). The structure-mapping engine: algorithms and examples. Artificial Intelligence, 34, 1–63.