Portfolios of subgraph isomorphism algorithms

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 10079 LNCS, Issue , 2016, Pages 107-122

  Kotthoff, Lars ^a   McCreesh, Ciaran ^b   Solnon, Christine ^c  

^a UNIVERSITY OF BRITISH COLUMBIA   (Canada)

^b UNIVERSITY OF GLASGOW   (United Kingdom)

^c CNRS   (France)

Author keywords

[No Author keywords available]

Indexed keywords

BENCHMARKING; MODEL CHECKING; SET THEORY;

ALGORITHM SELECTION; BENCH-MARK PROBLEMS; HARD PROBLEMS; PERFORMANCE CHARACTERISTICS; PERFORMANCE IMPROVEMENTS; STATE-OF-THE-ART ALGORITHMS; SUBGRAPH ISOMORPHISM; SUBGRAPH ISOMORPHISM PROBLEM;

PROBLEM SOLVING;

EID: 85006883406     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-319-50349-3_8     Document Type: Conference Paper

References (28)

1. Audemard, G., Lecoutre, C., Samy-Modeliar, M., Goncalves, G., Porumbel, D.: Scoring-based neighborhood dominance for the subgraph isomorphism problem. In: O’Sullivan, B. (ed.) CP 2014. LNCS, vol. 8656, pp. 125-141. Springer, Heidelberg (2014). doi:10.1007/978-3-319-10428-7_12. http://dx.doi.org/10.1007/978-3-319-10428-7_12
2. Battiti, R., Mascia, F.: An algorithm portfolio for the sub-graph isomorphism problem. In: Stützle, T., Birattari, M., Hoos, H.H. (eds.) SLS 2007. LNCS, vol. 4638, pp. 106-120. Springer, Heidelberg (2007). doi:10.1007/978-3-540-74446-7_8
3. Bischl, B., Kerschke, P., Kotthoff, L., Lindauer, M.T., Malitsky, Y., Fréchette, A., Hoos, H.H., Hutter, F., Leyton-Brown, K., Tierney, K., Vanschoren, J.: ASlib: a benchmark library for algorithm selection. Artif. Intell. J. (2016, in press)
4. Cohen, W.W.: Fast effective rule induction. In: Twelfth International Conference on Machine Learning, pp. 115-123. Morgan Kaufmann (1995)
5. Cordella, L.P., Foggia, P., Sansone, C., Vento, M.: A (sub)graph isomorphism algorithm for matching large graphs. IEEE Trans. Pattern Anal. Mach. Intell. 26(10), 1367-1372 (2004). http://doi.ieeecomputersociety.org/10.1109/TPAMI.2004.75
6. Damiand, G., Solnon, C., de la Higuera, C., Janodet, J.C., Samuel, E.: Polynomial algorithms for subisomorphism of nD open combinatorial maps. Comput. Vis. Image Underst. (CVIU) 115(7), 996-1010 (2011)
7. De Santo, M., Foggia, P., Sansone, C., Vento, M.: A large database of graphs and its use for benchmarking graph isomorphism algorithms. Pattern Recogn. Lett. 24(8), 1067-1079 (2003). http://dx.doi.org/10.1016/S0167-8655(02)00253-2
8. Giugno, R., Bonnici, V., Bombieri, N., Pulvirenti, A., Ferro, A., Shasha, D.: Grapes: a software for parallel searching on biological graphs targeting multi-core architectures. PLoS ONE 8(10), e76911 (2013). http://dx.doi.org/10.1371%2Fjournal. pone.0076911
9. Gomes, C.P., Selman, B.: Algorithm portfolios. Artif. Intell. 126(1-2), 43-62 (2001)
10. Huberman, B.A., Lukose, R.M., Hogg, T.: An economics approach to hard computational problems. Science 275(5296), 51-54 (1997)
11. Kotthoff, L.: LLAMA: Leveraging learning to automatically manage algorithms. Technical report arXiv:1306.1031 June 2003
12. Kotthoff, L.: Algorithm selection for combinatorial search problems: a survey. AI Mag. 35(3), 48-60 (2014)
13. Kotthoff, L., Kerschke, P., Hoos, H., Trautmann, H.: Improving the state of the art in inexact TSP solving using per-instance algorithm selection. In: Dhaenens, C., Jourdan, L., Marmion, M.-E. (eds.) LION 2015. LNCS, vol. 8994, pp. 202-217. Springer, Heidelberg (2015). doi:10.1007/978-3-319-19084-6_18
14. Larrosa, J., Valiente, G.: Constraint satisfaction algorithms for graph pattern matching. Math. Struct. Compt. Sci. 12(4), 403-422 (2002)
15. McCreesh, C., Prosser, P.: A parallel, backjumping subgraph isomorphism algorithm using supplemental graphs. In: Pesant, G. (ed.) CP 2015. LNCS, vol. 9255, pp. 295-312. Springer, Heidelberg (2015). doi:10.1007/978-3-319-23219-5_21. http://dx.doi.org/10.1007/978-3-319-23219-5_21
16. McCreesh, C., Prosser, P., Trimble, J.: Heuristics and really hard instances for subgraph isomorphism problems. In: IJCAI (2016, to appear)
17. McGregor, J.J.: Relational consistency algorithms and their application in finding subgraph and graph isomorphisms. Inf. Sci. 19(3), 229-250 (1979)
18. Mohr, R., Henderson, T.: Arc and path consistency revisited. Artif. Intell. 28, 225-233 (1986)
19. O’Mahony, E., Hebrard, E., Holland, A., Nugent, C., O’Sullivan, B.: Using casebased reasoning in an algorithm portfolio for constraint solving. In: Proceedings of the 19th Irish Conference on Artificial Intelligence and Cognitive Science, January 2008 20. Régin, J.C.: A filtering algorithm for constraints of difference in CSPs. In: Proceeding of the 12th Conference American Association Artificial Intelligence, vol. 1, pp. 362-367. American Association Artificial Intelligence (1994)
20. Rice, J.R.: The algorithm selection problem. Adv. Comput. 15, 65-118 (1976)
21. Sabharwal, A., Samulowitz, H.: Insights into parallelism with intensive knowledge sharing. In: O’Sullivan, B. (ed.) CP 2014. LNCS, vol. 8656, pp. 655-671. Springer, Heidelberg (2014). doi:10.1007/978-3-319-10428-7_48. http://dx.doi.org/10.1007/978-3-319-10428-7_12
22. Seipp, J., Braun, M., Garimort, J., Helmert, M.: Learning portfolios of automatically tuned planners. In: ICAPS (2012)
23. Sevegnani, M., Calder, M.: Bigraphs with sharing. Theor. Comput. Sci. 577, 43-73 (2015). http://www.sciencedirect.com/science/article/pii/S0304397515001085
24. Solnon, C., Damiand, G., de la Higuera, C., Janodet, J.: On the complexity of submap isomorphism and maximum common submap problems. Pattern Recogn. 48(2), 302-316 (2015)
25. Solnon, C.: Alldifferent-based filtering for subgraph isomorphism. Artif. Intell. 174(12-13), 850-864 (2010). http://dx.doi.org/10.1016/j.artint.2010.05.002
26. Ullmann, J.R.: An algorithm for subgraph isomorphism. J. ACM 23(1), 31-42 (1976)
27. Xu, L., Hutter, F., Hoos, H.H., Leyton-Brown, K.: SATzilla: Portfolio-based algorithm selection for SAT. J. Artif. Intell. Res. (JAIR) 32, 565-606 (2008)
28. Zampelli, S., Deville, Y., Solnon, C.: Solving subgraph isomorphism problems with constraint programming. Constraints 15(3), 327-353 (2010)