{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,4]],"date-time":"2026-04-04T04:42:57Z","timestamp":1775277777531,"version":"3.50.1"},"reference-count":22,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2015,5,30]],"date-time":"2015-05-30T00:00:00Z","timestamp":1432944000000},"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,1]]},"DOI":"10.1007\/s10115-015-0844-5","type":"journal-article","created":{"date-parts":[[2015,5,29]],"date-time":"2015-05-29T06:45:51Z","timestamp":1432881951000},"page":"213-239","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":8,"title":["Centrality measures-based algorithm to visualize a maximal common induced subgraph in large communication networks"],"prefix":"10.1007","volume":"46","author":[{"given":"Parisutham","family":"Nirmala","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Lekshmi","family":"Ramasubramony\u00a0Sulochana","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Nadarajan","family":"Rethnasamy","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2015,5,30]]},"reference":[{"key":"844_CR1","doi-asserted-by":"crossref","unstructured":"Akutsu T, Tamura T (2012) A polynomial-time algorithm for computing the maximum common subgraph of outerplanar graphs of bounded degree. In: Mathematical foundations of computer science 2012. Springer, Berlin, Heidelberg, pp 76\u201387","DOI":"10.1007\/978-3-642-32589-2_10"},{"issue":"4","key":"844_CR2","doi-asserted-by":"crossref","first-page":"407","DOI":"10.1504\/IJBRA.2013.054688","volume":"9","author":"RJV Berlo","year":"2013","unstructured":"Berlo RJV, Winterbach W, Groot MJD, Bender A, Verheijen PJ, Reinders MJ, Ridder DD (2013) Efficient calculation of compound similarity based on maximum common subgraphs and its application to prediction of gene transcript levels. Int J Bioinfor Res Appl 9(4):407\u2013432","journal-title":"Int J Bioinfor Res Appl"},{"key":"844_CR3","doi-asserted-by":"crossref","unstructured":"Bunke H, Foggia P, Guidobaldi C, Sansone C, Vento M (2002) A comparison of algorithms for maximum common subgraph on randomly connected graphs. In: Structural, syntactic, and statistical pattern recognition. Springer, Berlin, Heidelberg, pp. 123\u2013132","DOI":"10.1007\/3-540-70659-3_12"},{"issue":"1","key":"844_CR4","doi-asserted-by":"crossref","first-page":"99","DOI":"10.7155\/jgaa.00139","volume":"11","author":"D Conte","year":"2007","unstructured":"Conte D, Foggia P, Vento M (2007) Challenging complexity of maximum common subgraph algorithms: a performance analysis of three algorithms on a wide database of graphs. J Graph Algorithms Appl 11(1):99\u2013143","journal-title":"J Graph Algorithms Appl"},{"key":"844_CR5","doi-asserted-by":"crossref","DOI":"10.1002\/0470073047","volume-title":"Mining graph data","author":"DJ Cook","year":"2006","unstructured":"Cook DJ, Holder LB (2006) Mining graph data. Wiley, Hoboken"},{"issue":"3","key":"844_CR6","doi-asserted-by":"crossref","first-page":"243","DOI":"10.1007\/s10044-004-0222-5","volume":"7","author":"PJ Dickinson","year":"2004","unstructured":"Dickinson PJ, Bunke H, Dadej A, Kraetzl M (2004) Matching graphs with unique node labels. Pattern Anal Appl 7(3):243\u2013254","journal-title":"Pattern Anal Appl"},{"issue":"3","key":"844_CR7","doi-asserted-by":"crossref","first-page":"215","DOI":"10.1016\/0378-8733(78)90021-7","volume":"1","author":"LC Freeman","year":"1979","unstructured":"Freeman LC (1979) Centrality in social networks conceptual clarification. Soc Netw 1(3):215\u2013239","journal-title":"Soc Netw"},{"key":"844_CR8","volume-title":"Handbook of graph theory","author":"JL Gross","year":"2004","unstructured":"Gross JL, Yellen J (2004) Handbook of graph theory. CRC Press, Boca Raton"},{"issue":"1","key":"844_CR9","doi-asserted-by":"crossref","first-page":"23","DOI":"10.1002\/spe.4380120103","volume":"12","author":"JJ McGregor","year":"1982","unstructured":"McGregor JJ (1982) Backtrack search algorithms and the maximal common subgraph problem. Softw Pract Exp 12(1):23\u201334","journal-title":"Softw Pract Exp"},{"issue":"4","key":"844_CR10","doi-asserted-by":"crossref","first-page":"393","DOI":"10.1109\/34.277592","volume":"16","author":"J Rocha","year":"1994","unstructured":"Rocha J, Pavlidis T (1994) A shape analysis model with applications to a character recognition system. IEEE Trans Pattern Anal Mach Intell 16(4):393\u2013404","journal-title":"IEEE Trans Pattern Anal Mach Intell"},{"key":"844_CR11","doi-asserted-by":"crossref","unstructured":"Rutgers JH, Wolkotte PT, Holzenspies PK, Kuper J, Smit GJ (2010) An approximate maximum common subgraph algorithm for large digital circuits. In: 2010 13th Euromicro conference on digital system design: architectures, methods and tools (DSD), pp 699\u2013705","DOI":"10.1109\/DSD.2010.29"},{"issue":"03","key":"844_CR12","doi-asserted-by":"crossref","first-page":"475","DOI":"10.1142\/S0218001404003241","volume":"18","author":"A Schenker","year":"2004","unstructured":"Schenker A, Last M, Bunke H, Kandel A (2004) Classification of web documents using graph matching. Int J Pattern Recognit Artif Intell 18(03):475\u2013496","journal-title":"Int J Pattern Recognit Artif Intell"},{"key":"844_CR13","doi-asserted-by":"crossref","unstructured":"Shokoufandeh A, Dickinson S (2001) A unified framework for indexing and matching hierarchical shape structures. In: Visual Form 2001. Springer, Berlin, pp 67\u201384","DOI":"10.1007\/3-540-45129-3_6"},{"key":"844_CR14","doi-asserted-by":"crossref","unstructured":"Shoubridge P, Kraetzl M, WALLIS W, Bunke H (2002) Detection of abnormal change in a time series of graphs. J Interconnection Netw 3(01n02):85\u2013101","DOI":"10.1142\/S0219265902000562"},{"issue":"9","key":"844_CR15","doi-asserted-by":"crossref","first-page":"1960","DOI":"10.1109\/TKDE.2012.135","volume":"25","author":"HA Sleiman","year":"2013","unstructured":"Sleiman HA, Corchuelo R (2013) A survey on region extractors from web documents. IEEE Trans Knowl Data Eng 25(9):1960\u20131981","journal-title":"IEEE Trans Knowl Data Eng"},{"issue":"6","key":"844_CR16","doi-asserted-by":"crossref","first-page":"1544","DOI":"10.1109\/TKDE.2013.161","volume":"26","author":"HA Sleiman","year":"2014","unstructured":"Sleiman HA, Corchuelo R (2014) Trinity: on using trinary trees for unsupervised web data extraction. IEEE Trans Knowl Data Eng 26(6):1544\u20131556","journal-title":"IEEE Trans Knowl Data Eng"},{"issue":"3","key":"844_CR17","doi-asserted-by":"crossref","first-page":"191","DOI":"10.1016\/S0262-8856(97)00066-8","volume":"16","author":"PN Suganthan","year":"1998","unstructured":"Suganthan PN, Yan H (1998) Recognition of handprinted Chinese characters by constrained graph matching. Image Vis Comput 16(3):191\u2013201","journal-title":"Image Vis Comput"},{"key":"844_CR18","doi-asserted-by":"crossref","unstructured":"Suters WH, Abu-Khzam FN, Zhang Y, Symons CT, Samatova NF, Langston MA (2005) A new approach and faster exact methods for the maximum common subgraph problem. In: Computing and combinatorics. Springer, Berlin, Heidelberg, pp 717\u2013727 (2005)","DOI":"10.1007\/11533719_73"},{"issue":"S11","key":"844_CR19","first-page":"72","volume":"6","author":"R Vijayalakshmi","year":"2011","unstructured":"Vijayalakshmi R, Nadarajan R, Nirmala P, Thilaga M (2011) Performance monitoring of large communication networks using maximum common subgraphs. Int J Artif Intell 6(S11):72\u201386","journal-title":"Int J Artif Intell"},{"issue":"A11","key":"844_CR20","first-page":"92","volume":"7","author":"R Vijayalakshmi","year":"2011","unstructured":"Vijayalakshmi R, Nadarajan R, Nirmala P, Thilaga M (2011) A divisive clustering algorithm for performance monitoring of large networks using maximum common subgraphs. Int J Artif Intell 7(A11):92\u2013109","journal-title":"Int J Artif Intell"},{"issue":"3","key":"844_CR21","doi-asserted-by":"crossref","first-page":"351","DOI":"10.1007\/s11280-013-0204-x","volume":"17","author":"Y Yang","year":"2014","unstructured":"Yang Y, Yu JX, Gao H, Pei J, Li J (2014) Mining most frequently changing component in evolving graphs. World Wide Web 17(3):351\u2013376","journal-title":"World Wide Web"},{"issue":"12","key":"844_CR22","doi-asserted-by":"crossref","first-page":"1614","DOI":"10.1109\/TKDE.2006.197","volume":"18","author":"Y Zhai","year":"2006","unstructured":"Zhai Y, Liu B (2006) Structured data extraction from the web based on partial tree alignment. IEEE Trans Knowl Data Eng 18(12):1614\u20131628","journal-title":"IEEE Trans Knowl Data Eng"}],"container-title":["Knowledge and Information Systems"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10115-015-0844-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10115-015-0844-5\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10115-015-0844-5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,29]],"date-time":"2019-05-29T06:11:17Z","timestamp":1559110277000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10115-015-0844-5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,5,30]]},"references-count":22,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2016,1]]}},"alternative-id":["844"],"URL":"https:\/\/doi.org\/10.1007\/s10115-015-0844-5","relation":{},"ISSN":["0219-1377","0219-3116"],"issn-type":[{"value":"0219-1377","type":"print"},{"value":"0219-3116","type":"electronic"}],"subject":[],"published":{"date-parts":[[2015,5,30]]}}}