{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,1,16]],"date-time":"2024-01-16T17:59:56Z","timestamp":1705427996701},"reference-count":40,"publisher":"Springer Science and Business Media LLC","issue":"5","license":[{"start":{"date-parts":[[2016,10,6]],"date-time":"2016-10-06T00:00:00Z","timestamp":1475712000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Supercomput"],"published-print":{"date-parts":[[2017,5]]},"DOI":"10.1007\/s11227-016-1885-6","type":"journal-article","created":{"date-parts":[[2016,10,6]],"date-time":"2016-10-06T11:06:50Z","timestamp":1475752010000},"page":"1810-1851","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":6,"title":["Detecting subgraph isomorphism with MapReduce"],"prefix":"10.1007","volume":"73","author":[{"given":"P\u00e9ter","family":"Feh\u00e9r","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"M\u00e1rk","family":"Asztalos","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Tam\u00e1s","family":"Vajk","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Tam\u00e1s","family":"M\u00e9sz\u00e1ros","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"L\u00e1szl\u00f3","family":"Lengyel","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2016,10,6]]},"reference":[{"key":"1885_CR1","unstructured":"Apache Hadoop: Apache Hadoop Project (2011) http:\/\/hadoop.apache.org\/"},{"key":"1885_CR2","unstructured":"Windows Azure (2013) http:\/\/www.windowsazure.com\/en-us\/"},{"key":"1885_CR3","doi-asserted-by":"publisher","unstructured":"Bader DA, Madduri K (2006) Designing multithreaded algorithms for breadth-first search and st-connectivity on the cray mta-2. In: Parallel Processing, 2006. ICPP 2006. International Conference on, pp 523\u2013530. IEEE","DOI":"10.1109\/ICPP.2006.34"},{"key":"1885_CR4","unstructured":"Berry JW (2011) Practical heuristics for inexact subgraph isomorphism. Technical Report SAND2011-6558W, Sandia National Laboratories, Albuquerque"},{"key":"1885_CR5","doi-asserted-by":"publisher","unstructured":"Berry JW, Hendrickson B, Kahan S, Konecny P (2007) Software and algorithms for graph queries on multithreaded architectures. In: International Parallel and Distributed Processing Symposium, IEEE, pp 1\u201314","DOI":"10.1109\/IPDPS.2007.370685"},{"key":"1885_CR6","doi-asserted-by":"publisher","unstructured":"Br\u00f6cheler M, Pugliese A, Subrahmanian V (2010) Cosi: cloud oriented subgraph identification in massive social networks. In: 2010 International Conference on Advances in Social Networks Analysis and Mining (ASONAM), pp 248\u2013255","DOI":"10.1109\/ASONAM.2010.80"},{"key":"1885_CR7","doi-asserted-by":"publisher","unstructured":"Br\u00f6cheler M, Pugliese A, Subrahmanian VS (2009) Dogma: a disk-oriented graph matching algorithm for rdf databases. In: Proceedings of the 8th International Semantic Web Conference, ISWC \u201909. Springer, Berlin, pp 97\u2013113","DOI":"10.1007\/978-3-642-04930-9_7"},{"key":"1885_CR8","unstructured":"Hadoop wiki\u2014Powered by http:\/\/wiki.apache.org\/hadoop\/PoweredBy (2013)"},{"key":"1885_CR9","doi-asserted-by":"publisher","unstructured":"Chakrabarti D, Zhan Y, Faloutsos C (2004) R-mat: a recursive model for graph mining. In: SDM, vol. 4, pp 442\u2013446. SIAM","DOI":"10.1137\/1.9781611972740.43"},{"issue":"3","key":"1885_CR10","doi-asserted-by":"publisher","first-page":"45","DOI":"10.1145\/971617.971643","volume":"47","author":"T Coffman","year":"2004","unstructured":"Coffman T, Greenblatt S, Marcus S (2004) Graph-based technologies for intelligence analysis. Commun ACM 47(3):45\u201347","journal-title":"Commun ACM"},{"key":"1885_CR11","unstructured":"Graph 500\u00a0Steering Committee: graph 500 benchmark (2014) http:\/\/www.graph500.org\/"},{"issue":"10","key":"1885_CR12","doi-asserted-by":"publisher","first-page":"1367","DOI":"10.1109\/TPAMI.2004.75","volume":"26","author":"L Cordella","year":"2004","unstructured":"Cordella L, Foggia P, Sansone C, Vento M (2004) A (sub)graph isomorphism algorithm for matching large graphs. Pattern Anal Mach Intell IEEE Trans 26(10):1367\u20131372","journal-title":"Pattern Anal Mach Intell IEEE Trans"},{"key":"1885_CR13","doi-asserted-by":"publisher","unstructured":"Cordella LP, Foggia P, Sansone C, Tortorella F, Vento M (1998) Graph matching: a fast algorithm and its evaluation. In: Proceedings of the 14th International Conference on Pattern Recognition, pp 1582\u20131584","DOI":"10.1109\/ICPR.1998.712014"},{"key":"1885_CR14","unstructured":"Cordella LP, Foggia P, Sansone C, Vento M (2001) An improved algorithm for matching large graphs. In: 3rd IAPR-TC15 workshop on graph based representation (GbR2001)"},{"issue":"1","key":"1885_CR15","doi-asserted-by":"publisher","first-page":"107","DOI":"10.1145\/1327452.1327492","volume":"51","author":"J Dean","year":"2008","unstructured":"Dean J, Ghemawat S (2008) Mapreduce: simplified data processing on large clusters. Commun ACM 51(1):107\u2013113","journal-title":"Commun ACM"},{"key":"1885_CR16","unstructured":"Feh\u00e9r P (2013) Cloud enabled model processing approaches. In: Proceedings of the Automation and Applied Computer Science Workshop 2013 (AACS\u201913)"},{"key":"1885_CR17","doi-asserted-by":"publisher","unstructured":"Feh\u00e9r P, Lengyel L (2013) Investigating the candidate pair generation of the vf2 algorithm. In: The 12th IASTED International Conference on Software Engineering (SE2013), pp 814\u2013820","DOI":"10.2316\/P.2013.796-010"},{"key":"1885_CR18","doi-asserted-by":"publisher","unstructured":"Feh\u00e9r P, Vajk T, Charaf H, Lengyel L (2013) Mapreduce algorithm for finding st-connectivity. In: 4th IEEE International Conference on Cognitive Infococommunications\u2014CogInfoCom 2013","DOI":"10.1109\/CogInfoCom.2013.6719201"},{"key":"1885_CR19","unstructured":"Foggia P, Sansone C, Vento M (2001) A performance comparison of five algorithms for graph isomorphism. In: 3rd IAPR-TC15 workshop on graph based representation (GbR2001)"},{"key":"1885_CR20","unstructured":"Kang U, Tsourakakis C, Appel AP, Faloutsos C, Leskovec J (2008) HADI: fast diameter estimation and mining in massive graphs with Hadoop. Carnegie Mellon University, School of Computer Science, Machine Learning Department"},{"key":"1885_CR21","doi-asserted-by":"publisher","unstructured":"Karloff H, Suri S, Vassilvitskii S (2010) A model of computation for mapreduce. In: Proceedings of the Twenty-First Annual ACM-SIAM Symposium on Discrete Algorithms. Society for Industrial and Applied Mathematics, pp 938\u2013948","DOI":"10.1137\/1.9781611973075.76"},{"key":"1885_CR22","unstructured":"Kim SH, Lee KH, Choi H, Lee YJ (2013) Parallel processing of multiple graph queries using mapreduce. In: DBKDA 2013, The Fifth International Conference on Advances in Databases, Knowledge, and Data Applications, pp 33\u201338"},{"key":"1885_CR23","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4020-6291-9","volume-title":"An introduction to chemoinformatics","author":"AR Leach","year":"2007","unstructured":"Leach AR, Gillet VJ (2007) An introduction to chemoinformatics. Springer, Berlin"},{"issue":"4","key":"1885_CR24","doi-asserted-by":"publisher","first-page":"11","DOI":"10.1145\/2094114.2094118","volume":"40","author":"KH Lee","year":"2012","unstructured":"Lee KH, Lee YJ, Choi H, Chung YD, Moon B (2012) Parallel data processing with mapreduce: a survey. AcM sIGMoD Rec. 40(4):11\u201320","journal-title":"AcM sIGMoD Rec."},{"key":"1885_CR25","doi-asserted-by":"publisher","unstructured":"Leskovec J, Chakrabarti D, Kleinberg J, Faloutsos C (2005) Realistic, mathematically tractable graph generation and evolution, using kronecker multiplication. In: Jorge AM, Torgo L, Brazdil P, Camacho R, Gama J (eds) Knowledge discovery in databases: PKDD 2005. Springer, Berlin, pp 133\u2013145","DOI":"10.1007\/11564126_17"},{"key":"1885_CR26","doi-asserted-by":"publisher","unstructured":"Liu Y, Jiang X, Chen H, Ma J, Zhang X (2009) Mapreduce-based pattern finding algorithm applied in motif detection for prescription compatibility network. In: Dou Y, Gruber R, Joller JM (eds) Advanced parallel processing technologies. Springer, Berlin, pp 341\u2013355","DOI":"10.1007\/978-3-642-03644-6_27"},{"key":"1885_CR27","first-page":"45","volume":"30","author":"BD McKay","year":"1981","unstructured":"McKay BD (1981) Practical graph isomorphism. Congr Numer 30:45\u201387","journal-title":"Congr Numer"},{"key":"1885_CR28","unstructured":"Messmer BT, Bunke H (1995) Subgraph isomorphism in polynominal time. Technical Report IAM 95-003, Institute of Computer Science and Applied Mathematics, University of Bern, Bern"},{"key":"1885_CR29","doi-asserted-by":"crossref","unstructured":"Nilsson N (1982) Principles of artificial intelligence. Symbolic computation: artificial intelligence. Springer, Berlin","DOI":"10.1007\/978-3-662-09438-9"},{"key":"1885_CR30","doi-asserted-by":"publisher","unstructured":"Ohlrich M, Ebeling C, Ginting E, Sather L (1993) Subgemini: identifying subcircuits using a fast subgraph isomorphism algorithm. In: Proceedings of the 30th International Design Automation Conference, ACM, pp 31\u201337","DOI":"10.1145\/157485.164556"},{"key":"1885_CR31","doi-asserted-by":"publisher","unstructured":"Park HM, Chung CW (2013) An efficient mapreduce algorithm for counting triangles in a very large graph. In: Proceedings of the 22Nd ACM International Conference on Information & Knowledge Management, CIKM \u201913, ACM, pp 539\u2013548","DOI":"10.1145\/2505515.2505563"},{"key":"1885_CR32","doi-asserted-by":"publisher","unstructured":"Plantenga T (2013) Inexact subgraph isomorphism in mapreduce. J Parallel Distrib Comput 73(2):164\u2013175","DOI":"10.1016\/j.jpdc.2012.10.005"},{"issue":"2","key":"1885_CR33","doi-asserted-by":"crossref","first-page":"201","DOI":"10.3233\/FI-1998-33204","volume":"33","author":"D Plump","year":"1998","unstructured":"Plump D (1998) Termination of graph rewriting is undecidable. Fundam Inf 33(2):201\u2013209","journal-title":"Fundam Inf"},{"issue":"1","key":"1885_CR34","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1186\/1758-2946-1-12","volume":"1","author":"SA Rahman","year":"2009","unstructured":"Rahman SA, Bashton M, Holliday GL, Schrader R, Thornton JM (2009) Small molecule subgraph detector (smsd) toolkit. J Cheminformatics 1(1):1\u201313","journal-title":"J Cheminformatics"},{"key":"1885_CR35","unstructured":"Amazon Web Services (2013) http:\/\/aws.amazon.com"},{"issue":"1","key":"1885_CR36","doi-asserted-by":"publisher","first-page":"99","DOI":"10.1111\/j.1467-9531.2006.00176.x","volume":"36","author":"TA Snijders","year":"2006","unstructured":"Snijders TA, Pattison PE, Robins GL, Handcock MS (2006) New specifications for exponential random graph models. Sociol Methodol 36(1):99\u2013153","journal-title":"Sociol Methodol"},{"key":"1885_CR37","doi-asserted-by":"publisher","unstructured":"Tong H, Faloutsos C, Gallagher B, Eliassi-Rad T (2007) Fast best-effort pattern matching in large attributed graphs. In: Proceedings of the 13th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, ACM, pp 737\u2013746","DOI":"10.1145\/1281192.1281271"},{"key":"1885_CR38","doi-asserted-by":"publisher","unstructured":"Tsourakakis CE, Kang U, Miller GL, Faloutsos C (2009) Doulion: counting triangles in massive graphs with a coin. In: Proceedings of the 15th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, KDD \u201909, pp 837\u2013846","DOI":"10.1145\/1557019.1557111"},{"key":"1885_CR39","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1145\/321921.321925","volume":"23","author":"JR Ullmann","year":"1976","unstructured":"Ullmann JR (1976) An algorithm for subgraph isomorphism. J Assoc Comput Mach 23:31\u201342","journal-title":"J Assoc Comput Mach"},{"key":"1885_CR40","doi-asserted-by":"publisher","unstructured":"Zhao Z, Wang G, Butt AR, Khan M, Kumar V, Marathe MV (2012) Sahad: Subgraph analysis in massive networks using hadoop. In: Parallel & Distributed Processing Symposium (IPDPS), 2012 IEEE 26th International, IEEE, pp 390\u2013401","DOI":"10.1109\/IPDPS.2012.44"}],"container-title":["The Journal of Supercomputing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11227-016-1885-6\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11227-016-1885-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11227-016-1885-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,9,26]],"date-time":"2020-09-26T12:52:46Z","timestamp":1601124766000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11227-016-1885-6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,10,6]]},"references-count":40,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2017,5]]}},"alternative-id":["1885"],"URL":"https:\/\/doi.org\/10.1007\/s11227-016-1885-6","relation":{},"ISSN":["0920-8542","1573-0484"],"issn-type":[{"value":"0920-8542","type":"print"},{"value":"1573-0484","type":"electronic"}],"subject":[],"published":{"date-parts":[[2016,10,6]]}}}