Author:
Conte D.,Guidobaldi C.,Sansone C.
Publisher
Springer Berlin Heidelberg
Reference9 articles.
1. C. Bron and J. Kerbosch, “Finding All the Cliques in an Undirected Graph”, Communication of the ACM 16(1973), 575–577.
2. I. M. Bomze, M. Budinich, P. M. Pardalos, and M. Pelillo, “The Maximum Clique Problem”, Handbook of Combinatorial Optimization, vol. 4, Kluwer Academic Publisher, Boston Pattern MA, 1999.
3. H. Bunke, M. Vento, “Benchmarking of Graph Matching Algorithms”, Proc. 2nd IAPR TC-15 GbR Workshop, Haindorf, pp. 109–114, 1999.
4. M. De Santo, P. Foggia, C. Sansone, M. Vento, “A Large Database of Graphs and its use for Benchmarking Graph Isomorphism Algorithms” Pattern Recognition Letters, vol. 24, no. 8, pp. 1067–1079, 2003.
5. J.J. McGregor, “Backtrack Search Algorithms and the Maximal Common Subgraph Problem”, Software Practice and Experience, Vol. 12, pp. 23–34, 1982.
Cited by
7 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献