A Comparison of Algorithms for Maximum Common Subgraph on Randomly Connected Graphs

Horst Bunke, Pasquale Foggia, C. Guidobaldi, Carlo Sansone, Mario Vento. A Comparison of Algorithms for Maximum Common Subgraph on Randomly Connected Graphs. In Terry Caelli, Adnan Amin, Robert P. W. Duin, Mohamed S. Kamel, Dick de Ridder, editors, Structural, Syntactic, and Statistical Pattern Recognition, Joint IAPR International Workshops SSPR 2002 and SPR 2002, Windsor, Ontario, Canada, August 6-9, 2002, Proceedings. Volume 2396 of Lecture Notes in Computer Science, pages 123-132, Springer, 2002. [doi]

Abstract

Abstract is missing.