{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,4]],"date-time":"2025-05-04T02:06:48Z","timestamp":1746324408152},"reference-count":36,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2015,3,24]],"date-time":"2015-03-24T00:00:00Z","timestamp":1427155200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Knowl Inf Syst"],"published-print":{"date-parts":[[2016,3]]},"DOI":"10.1007\/s10115-015-0829-4","type":"journal-article","created":{"date-parts":[[2015,3,23]],"date-time":"2015-03-23T09:10:20Z","timestamp":1427101820000},"page":"537-565","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":6,"title":["Hypergraph querying using structural indexing and layer-related-closure verification"],"prefix":"10.1007","volume":"46","author":[{"given":"Xinran","family":"Yu","sequence":"first","affiliation":[]},{"given":"Turgay","family":"Korkmaz","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2015,3,24]]},"reference":[{"issue":"24","key":"829_CR1","doi-asserted-by":"crossref","first-page":"5234","DOI":"10.1103\/PhysRevLett.85.5234","volume":"85","author":"R Albert","year":"2000","unstructured":"Albert R, Barab\u00e1si AL (2000) Topology of evolving networks: local events and universality. Phys Rev Lett 85(24):5234\u20135237","journal-title":"Phys Rev Lett"},{"issue":"3","key":"829_CR2","doi-asserted-by":"crossref","first-page":"209","DOI":"10.1007\/BF02523189","volume":"17","author":"A Alon","year":"1997","unstructured":"Alon A, Yuster R, Zwick U (1997) Finding and counting given length cycles. Algorithmica 17(3):209\u2013223","journal-title":"Algorithmica"},{"key":"829_CR3","volume-title":"Graphs and hypergraphs","author":"C Berge","year":"1976","unstructured":"Berge C (1976) Graphs and hypergraphs, vol 6. Elsevier, Amsterdam"},{"issue":"2","key":"829_CR4","doi-asserted-by":"crossref","first-page":"127","DOI":"10.1016\/0012-365X(79)90105-5","volume":"27","author":"Richard A Brualdi","year":"1979","unstructured":"Brualdi Richard A (1979) The diagonal hypergraph of a matrix (bipartite graph). Discrete Math 27(2):127\u2013147","journal-title":"Discrete Math"},{"key":"829_CR5","doi-asserted-by":"crossref","unstructured":"Bunke H, Dickinson P, Kraetzl M (2005) Theoretical and algorithmic framework for hypergraph matching. In: Image analysis and processing\u2014ICIAP 2005, pp 463\u2013470","DOI":"10.1007\/11553595_57"},{"key":"829_CR6","doi-asserted-by":"crossref","unstructured":"Bunke H, Dickinson P, Kraetzl M, Neuhaus M, Stettler M (2008) Matching of Hypergraphs\u2014Algorithms, Applications, and Experiments. In: Bunke H, Kandel A, Last M (eds) Applied pattern recognition. Springer, Berlin, pp 131\u2013154","DOI":"10.1007\/978-3-540-76831-9_6"},{"key":"829_CR7","doi-asserted-by":"crossref","first-page":"5","DOI":"10.1145\/351827.384247","volume":"5","author":"AE Caldwell","year":"1997","unstructured":"Caldwell AE, Kahng A, Markov IL (1997) Design and implementation of move-based heuristics for VLSI hypergraph partitioning. J Exp Algorithmics (JEA) 5:5","journal-title":"J Exp Algorithmics (JEA)"},{"issue":"4","key":"829_CR8","first-page":"17","volume":"6","author":"S Chu","year":"2012","unstructured":"Chu S, Cheng J (2012) Triangle listing in massive networks. ACM Trans Knowl Discov Data (TKDD) 6(4):17","journal-title":"ACM Trans Knowl Discov Data (TKDD)"},{"key":"829_CR9","unstructured":"Estrada E, Rodriguez-Velazquez JA (2005) Complex networks as hypergraphs. arXiv preprint physics\/0505137"},{"issue":"4","key":"829_CR10","doi-asserted-by":"crossref","first-page":"251","DOI":"10.1145\/316194.316229","volume":"29","author":"M Faloutsos","year":"1999","unstructured":"Faloutsos M, Faloutsos P, Faloutsos C (1999) On power-law relationships of the internet topology. ACM SIGCOMM Comput Commun Rev 29(4):251\u2013262","journal-title":"ACM SIGCOMM Comput Commun Rev"},{"key":"829_CR11","doi-asserted-by":"crossref","unstructured":"Giugno R, Shasha D (2002) Graphgrep: a fast and universal method for querying graphs. In: Proceedings of 16th international conference on pattern recognition, IEEE, vol 2, pp 112\u2013115","DOI":"10.1109\/ICPR.2002.1048250"},{"key":"829_CR12","unstructured":"He H, Singh AK (2006) Closure-tree: An index structure for graph queries. In: Proceedings of the 22nd international conference on data engineering (ICDE), pp 38\u201338"},{"key":"829_CR13","volume-title":"Frequent hypergraph mining. Inductive logic programming","author":"T Horv\u00e1th","year":"2007","unstructured":"Horv\u00e1th T, Bringmann B, De Raedt L (2007) Frequent hypergraph mining. Inductive logic programming. Springer, Berlin"},{"key":"829_CR14","doi-asserted-by":"crossref","unstructured":"Hwang T, Tian Z, Kuang R, Kocher J-P (2008) Learning on weighted hypergraphs to integrate protein interactions and gene expressions for cancer outcome prediction. In: Eighth IEEE international conference on data mining, 2008 (ICDM\u201908), pp 293\u2013302","DOI":"10.1109\/ICDM.2008.37"},{"key":"829_CR15","doi-asserted-by":"crossref","unstructured":"Jiang H, Wang H, Yu PS, Zhou S (2007) Gstring: A novel approach for efficient search in graph databases. In: IEEE 23rd international conference on data engineering, 2007 (ICDE 2007), IEEE, pp 566\u2013575","DOI":"10.1109\/ICDE.2007.367902"},{"key":"829_CR16","doi-asserted-by":"crossref","unstructured":"Kardes H, Gunes MH (2010) Structural graph indexing for mining complex networks. In: EEE 30th international conference on distributed computing systems workshops (ICDCSW), pp 99\u2013104","DOI":"10.1109\/ICDCSW.2010.42"},{"key":"829_CR17","doi-asserted-by":"crossref","unstructured":"Karypis G, Aggarwal R, Kumar V, Shekhar S (1997) Multilevel hypergraph partitioning: Application in vlsi domain. In: Proceedings of the 34th annual design automation conference, ACM, pp 526\u2013529","DOI":"10.1109\/DAC.1997.597203"},{"issue":"5","key":"829_CR18","doi-asserted-by":"crossref","first-page":"e1000385","DOI":"10.1371\/journal.pcbi.1000385","volume":"5","author":"S Klamt","year":"2009","unstructured":"Klamt S, Haus U, Theis F (2009) Hypergraphs and cellular networks. PLoS Comput Biol 5(5):e1000385","journal-title":"PLoS Comput Biol"},{"key":"829_CR19","doi-asserted-by":"crossref","DOI":"10.4135\/9781412985864","volume-title":"Social network analysis","author":"D Knoke","year":"2008","unstructured":"Knoke D, Yang S, Kuklinski JH (2008) Social network analysis. Sage Publications, Los Angeles 2"},{"issue":"1","key":"829_CR20","doi-asserted-by":"crossref","first-page":"365","DOI":"10.1016\/S0012-365X(00)00290-9","volume":"235","author":"E Konstantinova","year":"2001","unstructured":"Konstantinova E, Skorobogatov V (2001) Application of hypergraph theory in chemistry. Discrete Math 235(1):365\u2013383","journal-title":"Discrete Math"},{"issue":"3","key":"829_CR21","doi-asserted-by":"crossref","first-page":"472","DOI":"10.1021\/ci00025a015","volume":"35","author":"E Konstantinova","year":"1995","unstructured":"Konstantinova E, Skorobogatov V (1995) Molecular hypergraphs: the new representation of nonclassical molecular structures with polycentric delocalized bonds. J Chem Inf Comput Sci 35(3):472\u2013478","journal-title":"J Chem Inf Comput Sci"},{"key":"829_CR22","doi-asserted-by":"crossref","unstructured":"Lin J, Schatz M (2010) Design patterns for efficient graph algorithms in MapReduce. In: Proceedings of the eighth workshop on mining and learning with Graphs, ACM, pp 78\u201385","DOI":"10.1145\/1830252.1830263"},{"issue":"8","key":"829_CR23","doi-asserted-by":"crossref","first-page":"716","DOI":"10.14778\/2212351.2212354","volume":"5","author":"Y Low","year":"2012","unstructured":"Low Y, Bickson D, Gonzalez J, Guestrin C, Kyrola A, Hellerstein J (2012) Distributed GraphLab: a framework for machine learning and data mining in the cloud. Proc VLDB Endow 5(8):716\u2013727","journal-title":"Proc VLDB Endow"},{"key":"829_CR24","volume-title":"Hypergraph partitioning and clustering. Approximation algorithms and metaheuristics","author":"DA Papa","year":"2006","unstructured":"Papa DA, Markov IL (2006) Hypergraph partitioning and clustering. Approximation algorithms and metaheuristics. CRC, Boca Ratan"},{"key":"829_CR25","doi-asserted-by":"crossref","unstructured":"Ramadan E, Tarafdar A, Pothen A (2004) A hypergraph model for the yeast protein complex network. In: Proceedings of the 18th international parallel and distributed processing symposium, pp 189","DOI":"10.1109\/IPDPS.2004.1303205"},{"key":"829_CR26","volume-title":"Finding, counting and listing all triangles in large graphs, an experimental study. Experimental and efficient algorithms","author":"T Schank","year":"2005","unstructured":"Schank T, Wagner D (2005) Finding, counting and listing all triangles in large graphs, an experimental study. Experimental and efficient algorithms. Springer, Berlin"},{"issue":"2","key":"829_CR27","doi-asserted-by":"crossref","first-page":"101","DOI":"10.1108\/17440081011053104","volume":"6","author":"S Sakr","year":"2010","unstructured":"Sakr S, Al-Naymat G (2010) Graph indexing and querying: a review. Int J Web Inf Syst 6(2):101\u2013120","journal-title":"Int J Web Inf Syst"},{"key":"829_CR28","doi-asserted-by":"crossref","unstructured":"Suri S, Vassilvitskii S (2011) Counting triangles and the curse of the last reducer. In: Proceedings of the 20th international conference on world wide web, ACM, pp 607\u2013614","DOI":"10.1145\/1963405.1963491"},{"key":"829_CR29","doi-asserted-by":"crossref","unstructured":"Tian Y, Patel JM (2008) Tale: A tool for approximate large graph matching. In: IEEE 24th international conference on data engineering (ICDE), pp 963\u2013972","DOI":"10.1109\/ICDE.2008.4497505"},{"key":"829_CR30","doi-asserted-by":"crossref","unstructured":"Tsourakakis, Charalampos E (2008) Fast counting of triangles in large real networks without counting: Algorithms and laws. In: Eighth IEEE international conference on data mining, 2008 (ICDM\u201908), pp 608\u2013617","DOI":"10.1109\/ICDM.2008.72"},{"key":"829_CR31","doi-asserted-by":"crossref","unstructured":"Wang X, Smalter A, Huan J, Lushington GH (2009) G-hash: towards fast kernel-based similarity search in large graph databases. In: Proceedings of the 12th international conference on extending database technology: advances in database technology, pp 472\u2013480","DOI":"10.1145\/1516360.1516416"},{"key":"829_CR32","first-page":"440","volume":"393","author":"D Watts","year":"1998","unstructured":"Watts D, Strogatz S (1998) The small world problem. Collect Dyn Small-World Netw 393:440\u2013442","journal-title":"Collect Dyn Small-World Netw"},{"key":"829_CR33","doi-asserted-by":"crossref","unstructured":"Yan X, Yu PS, Han J (2004) Graph indexing: a frequent structure-based approach. In: Proceedings of the 2004 ACM SIGMOD international conference on management of data, pp 335\u2013346","DOI":"10.1145\/1007568.1007607"},{"key":"829_CR34","doi-asserted-by":"crossref","unstructured":"Zhang S, Li S, Yang J (2009) GADDI: distance index based subgraph matching in biological networks. In: Proceedings of the 12th international conference on extending database technology: advances in database technology, pp 192\u2013203","DOI":"10.1145\/1516360.1516384"},{"issue":"1\u20132","key":"829_CR35","doi-asserted-by":"crossref","first-page":"1185","DOI":"10.14778\/1920841.1920988","volume":"3","author":"S Zhang","year":"2010","unstructured":"Zhang S, Yang J, Jin W (2010) SAPPER: subgraph indexing and approximate matching in large graphs. Proc VLDB Endow 3(1\u20132):1185\u20131194","journal-title":"Proc VLDB Endow"},{"issue":"1","key":"829_CR36","doi-asserted-by":"crossref","first-page":"31","DOI":"10.1145\/321921.321925","volume":"23","author":"Julian R Ullmann","year":"1976","unstructured":"Ullmann Julian R (1976) An algorithm for subgraph isomorphism. Journal of the ACM (JACM) 23(1):31\u201342","journal-title":"Journal of the ACM (JACM)"}],"container-title":["Knowledge and Information Systems"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10115-015-0829-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10115-015-0829-4\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10115-015-0829-4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,29]],"date-time":"2019-05-29T10:11:17Z","timestamp":1559124677000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10115-015-0829-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,3,24]]},"references-count":36,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2016,3]]}},"alternative-id":["829"],"URL":"https:\/\/doi.org\/10.1007\/s10115-015-0829-4","relation":{},"ISSN":["0219-1377","0219-3116"],"issn-type":[{"value":"0219-1377","type":"print"},{"value":"0219-3116","type":"electronic"}],"subject":[],"published":{"date-parts":[[2015,3,24]]}}}