{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,11]],"date-time":"2025-10-11T08:09:25Z","timestamp":1760170165464},"reference-count":37,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2004,10,6]],"date-time":"2004-10-06T00:00:00Z","timestamp":1097020800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Pattern Anal Applic"],"published-print":{"date-parts":[[2004,12]]},"DOI":"10.1007\/s10044-004-0222-5","type":"journal-article","created":{"date-parts":[[2004,10,5]],"date-time":"2004-10-05T13:34:01Z","timestamp":1096983241000},"page":"243-254","source":"Crossref","is-referenced-by-count":58,"title":["Matching graphs with unique node labels"],"prefix":"10.1007","volume":"7","author":[{"given":"Peter J.","family":"Dickinson","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Horst","family":"Bunke","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Arek","family":"Dadej","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Miro","family":"Kraetzl","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2004,10,6]]},"reference":[{"key":"222_CR1","unstructured":"(2001) Special section on graph algorithms and computer vision. IEEE Trans PAMI 23(10)"},{"key":"222_CR2","unstructured":"(2003) Special issue on graph-based representations in pattern recognition. Pattern Recognit Lett 24(8)"},{"key":"222_CR3","unstructured":"(2004) Special issue on graph matching in pattern recognition and machine vision. Int J Pattern Recognit Artif Intell 18(3)"},{"key":"222_CR4","first-page":"45","volume":"30","author":"B McKay","year":"1981","unstructured":"McKay B (1981) Practical graph isomorphism. Congressus Numerantium 30:45\u201387","journal-title":"Congressus Numerantium"},{"issue":"1","key":"222_CR5","doi-asserted-by":"crossref","first-page":"31","DOI":"10.1145\/321921.321925","volume":"23","author":"JR Ullman","year":"1976","unstructured":"Ullman JR (1976) An algorithm for subgraph isomorphism. J ACM 23(1):31\u201342","journal-title":"J ACM"},{"key":"222_CR6","doi-asserted-by":"crossref","first-page":"341","DOI":"10.1007\/BF02575586","volume":"9","author":"G Levi","year":"1972","unstructured":"Levi G (1972) A note on the derivation of maximal common subgraphs of two directed or undirected graphs. Calcolo 9:341\u2013354","journal-title":"Calcolo"},{"issue":"1","key":"222_CR7","doi-asserted-by":"crossref","first-page":"23","DOI":"10.1002\/spe.4380120103","volume":"12","author":"J McGregor","year":"1982","unstructured":"McGregor J (1982) Backtrack search algorithms and the maximal common subgraph problem. Software Pract Experience 12(1):23\u201334","journal-title":"Software Pract Experience"},{"key":"222_CR8","doi-asserted-by":"crossref","first-page":"493","DOI":"10.1109\/34.682179","volume":"20","author":"BT Messmer","year":"1998","unstructured":"Messmer BT, Bunke H (1998) A new algorithm for error-tolerant subgraph isomorphism detection. IEEE Trans Pattern Anal Machine Intell 20:493\u2013504","journal-title":"IEEE Trans Pattern Anal Machine Intell"},{"issue":"3","key":"222_CR9","doi-asserted-by":"crossref","first-page":"353","DOI":"10.1109\/TSMC.1983.6313167","volume":"13","author":"A Sanfeliu","year":"1983","unstructured":"Sanfeliu A, Fu KS (1983) A distance measure between attributed relational graphs for pattern recognition. IEEE Trans Syst Man Cybern 13(3):353\u2013362","journal-title":"IEEE Trans Syst Man Cybern"},{"key":"222_CR10","unstructured":"Cordella LP, Foggia P, Sansone C, Vento M (2001) An improved algorithm for matching large graphs. In: Proceedings of the 3rd IAPR-TC15 workshop on graph based representations in pattern recognition, Naples, Italy, May 2001, pp 149\u2013159"},{"key":"222_CR11","doi-asserted-by":"crossref","first-page":"403","DOI":"10.1017\/S0960129501003577","volume":"12","author":"J Larrosa","year":"2002","unstructured":"Larrosa J, Valiente G (2002) Constraint satisfaction algorithms for graph pattern matching. Math Struct Comput Sci 12:403\u2013422","journal-title":"Math Struct Comput Sci"},{"key":"222_CR12","doi-asserted-by":"crossref","first-page":"749","DOI":"10.1109\/34.400565","volume":"8","author":"WJ Christmas","year":"1995","unstructured":"Christmas WJ, Kittler J, Petrou M (1995) Structural matching in computer vision using probabilistic relaxation. IEEE Trans PAMI 8:749\u2013764","journal-title":"IEEE Trans PAMI"},{"key":"222_CR13","doi-asserted-by":"crossref","first-page":"634","DOI":"10.1109\/34.601251","volume":"19","author":"RC Wilson","year":"1997","unstructured":"Wilson RC, Hancock E (1997) Structural matching by discrete relaxation. IEEE Trans PAMI 19:634\u2013648","journal-title":"IEEE Trans PAMI"},{"key":"222_CR14","doi-asserted-by":"crossref","first-page":"953","DOI":"10.1016\/S0031-3203(96)00123-9","volume":"30","author":"A Cross","year":"1997","unstructured":"Cross A, Wilson R, Hancock E (1997) Inexact graph matching with genetic search. Pattern Recognit 30:953\u2013970","journal-title":"Pattern Recognit"},{"key":"222_CR15","first-page":"588","volume":"27","author":"I Wang","year":"1997","unstructured":"Wang I, Fan K-C, Horng J-T (1997) Genetic-based search for error-correcting graph isomorphism. IEEE Trans SMC 27:588\u2013597","journal-title":"IEEE Trans SMC"},{"key":"222_CR16","doi-asserted-by":"crossref","first-page":"1120","DOI":"10.1109\/34.954602","volume":"23","author":"B Luo","year":"2001","unstructured":"Luo B, Hancock E (2001) Structural graph matching using the EM algorithm and singular value decomposition. IEEE Trans PAMI 23:1120\u20131136","journal-title":"IEEE Trans PAMI"},{"key":"222_CR17","doi-asserted-by":"crossref","first-page":"133","DOI":"10.1007\/3-540-70659-3_13","volume-title":"Structural, syntactic, and statistical pattern recognition, LNCS 2396","author":"S Kosinov","year":"2002","unstructured":"Kosinov S, Caelli T (2002) Inexact multisubgraph matching using graph eigenspace and clustering models. In: Caelli T, Amin A, Duin R, Kamel M, de Ridder D (eds) Structural, syntactic, and statistical pattern recognition, LNCS 2396. Springer, Berlin Heidelberg New York, pp 133\u2013142"},{"key":"222_CR18","doi-asserted-by":"crossref","first-page":"83","DOI":"10.1007\/3-540-70659-3_8","volume-title":"Structural, syntactic, and statistical pattern recognition, LNCS 2396","author":"B Luo","year":"2002","unstructured":"Luo B, Wilson R, Hancock E (2002) Spectral feature vectors for graph clustering. In: Caelli T, Amin A, Duin R, Kamel M, de Ridder D (eds) Structural, syntactic, and statistical pattern recognition, LNCS 2396. Springer, Berlin Heidelberg New York, pp 83\u201393"},{"issue":"4","key":"222_CR19","first-page":"411","volume":"2","author":"M Pelillo","unstructured":"Pelillo M, Jagota A (1995) Feasible and infeasible maxima in a quadratic program for maximum clique. J Art Neural Netw 2(4):411\u2013420","journal-title":"J Art Neural Netw"},{"key":"222_CR20","unstructured":"Hopcroft JE, Wong JK (1974) Linear time algorithm for isomorphism of planar graphs. In: Proceedings of the 6th annual ACM symposium on theory of computing, Seattle, Washington, April\/May 1974, pp 172\u2013184"},{"key":"222_CR21","doi-asserted-by":"crossref","first-page":"110","DOI":"10.1007\/3-540-61577-6_12","volume-title":"Advances in structural and syntactic pattern recognition, LNCS 1121","author":"X Jiang","year":"1996","unstructured":"Jiang X, Bunke H (1996) Including geometry in graph representations: a quadratic-time graph isomorphism algorithm and its application. In: Perner P, Wang P, Rosenfeld A (eds) Advances in structural and syntactic pattern recognition, LNCS 1121. Springer, Berlin Heidelberg New York, pp 110\u2013119"},{"key":"222_CR22","doi-asserted-by":"crossref","first-page":"42","DOI":"10.1016\/0022-0000(82)90009-5","volume":"25","author":"EM Luks","year":"1982","unstructured":"Luks EM (1982) Isomorphism of graphs of bounded valence can be tested in polynomial time. J Comput Syst Sci 25:42\u201365","journal-title":"J Comput Syst Sci"},{"issue":"11","key":"222_CR23","doi-asserted-by":"crossref","first-page":"1535","DOI":"10.1109\/TPAMI.2002.1046176","volume":"24","author":"M Pelillo","year":"2002","unstructured":"Pelillo M (2002) Matching free trees, maximal cliques, and monotone game dynamics. IEEE Trans PAMI 24(11):1535\u20131541","journal-title":"IEEE Trans PAMI"},{"key":"222_CR24","first-page":"67","volume-title":"Visual form 2001 LNCS 2059","author":"A Shokonfandeh","year":"2001","unstructured":"Shokonfandeh A, Dickinson S (2001) A unified framework for indexing and matching hierarchical shape structures. In: Arcelli C, Cordella L, Sanniti di Baja G (eds) Visual form 2001, LNCS 2059. Springer, Berlin Heidelberg New York, pp 67\u201384"},{"key":"222_CR25","volume-title":"Web document analysis: challenges and opportunities","author":"A Schenker","year":"2003","unstructured":"Schenker A, Last M, Bunke H, Kandel A (2003) Clustering of web documents using a graph model. In: A Antonacopoulos, H Jianying (eds) Web document analysis: challenges and opportunities. World Scientific, River Edge, New Jersey"},{"key":"222_CR26","doi-asserted-by":"crossref","unstructured":"Schenker A, Last M, Bunke H, Kandel A (2003) Classification of web documents using a graph model. In: Proceedings of the 7th international conference on document analysis and recognition, Edinburgh, Scotland, August 2003, pp 472\u2013476","DOI":"10.1109\/ICDAR.2003.1227666"},{"key":"222_CR27","doi-asserted-by":"crossref","first-page":"475","DOI":"10.1142\/S0218001404003241","volume":"18","author":"Schenker","year":"2004","unstructured":"Schenker A, Last M, Bunke H, Kandel A (2004) Classification of web documents using graph matching. Pattern Recognit Artif Intell 18(3):475\u2013496","journal-title":"Pattern Recognit Artif Intell"},{"key":"222_CR28","doi-asserted-by":"crossref","unstructured":"Dickinson P, Bunke H, Dadej A, Kraetzl M (2003) On graphs with unique node labels. In: Hancock E, Vento M (eds) Proceedings of the 4th IAPR international workshop on graph based representations in pattern recognition (GbRPR 2003), York, UK, June\/July 2003. Springer, Berlin Heidelberg New York, pp 13\u201323","DOI":"10.1007\/3-540-45028-9_2"},{"issue":"10","key":"222_CR29","doi-asserted-by":"crossref","first-page":"1144","DOI":"10.1109\/34.954604","volume":"23","author":"X Jiang","year":"2001","unstructured":"Jiang X, Munger A, Bunke H (2001) On median graphs: properties, algorithms, and applications. PAMI 23(10):1144\u20131151","journal-title":"PAMI"},{"key":"222_CR30","doi-asserted-by":"crossref","first-page":"917","DOI":"10.1109\/34.790431","volume":"21","author":"H Bunke","year":"1999","unstructured":"Bunke H (1999) Error correcting graph matching: on the influence of the underlying cost function. IEEE Trans PAMI 21:917\u2013922","journal-title":"IEEE Trans PAMI"},{"issue":"5325","key":"222_CR31","doi-asserted-by":"crossref","first-page":"535","DOI":"10.1126\/science.277.5325.535","volume":"277","author":"BA Huberman","year":"1997","unstructured":"Huberman BA, Lukose RM (1997) Social dilemmas and internet congestion. Science 277(5325):535\u2013537","journal-title":"Science"},{"issue":"2","key":"222_CR32","doi-asserted-by":"crossref","first-page":"197","DOI":"10.1023\/A:1018774912261","volume":"5","author":"AP Snow","year":"1997","unstructured":"Snow AP, Weiss MBH (1997) Empirical evidence of reliability growth in large-scale networks. Netw Syst Manag 5(2):197\u2013213","journal-title":"Netw Syst Manag"},{"key":"222_CR33","unstructured":"Dickinson P, Bunke H, Dadej A, Kraetzl M (2001) Application of median graphs in detection of anomalous change in communication networks. In: Proceedings of the 5th world multiconference on systemics, cybernetics and informatics (SCI 2001) vol 5, Orlando, Florida, July 2001"},{"key":"222_CR34","doi-asserted-by":"crossref","first-page":"85","DOI":"10.1142\/S0219265902000562","volume":"3","author":"PJ Shoubridge","year":"2002","unstructured":"Shoubridge PJ, Kraetzl M, Wallis WD, Bunke H (2002) Detection of abnormal change in a time series of graphs. J Interconnection Netw 3:85\u2013101","journal-title":"J Interconnection Netw"},{"key":"222_CR35","doi-asserted-by":"crossref","unstructured":"Bunke H, Kraetzl M, Shoubridge PJ, Wallis WD (2002) Measuring change in large enterprise data networks. In: Proceedings of the conference on information, decision and control (IDC 2002), Adelaide, South Australia, February 2002, pp 53\u201358","DOI":"10.1109\/IDC.2002.995365"},{"key":"222_CR36","doi-asserted-by":"crossref","first-page":"125","DOI":"10.1007\/PL00012580","volume":"6","author":"FRK Chung","year":"2002","unstructured":"Chung FRK, Lu L (2002) Connected components in random graphs with given expected degree sequences. Ann Comb (6):125\u2013145","journal-title":"Ann Comb ("},{"key":"222_CR37","doi-asserted-by":"crossref","unstructured":"Tangmunarunkit H, Govindan R, Jamin S, Shenker S, Willinger W (2002) Network topology generators: degree-based vs structural. In: Proceedings of the ACM SIGCOMM 2002 conference on applications, technologies, architectures, and protocols for computer communication, Pittsburgh, Pennsylvania, August 2002","DOI":"10.1145\/633025.633040"}],"container-title":["Pattern Analysis and Applications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10044-004-0222-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10044-004-0222-5\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10044-004-0222-5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,3]],"date-time":"2020-04-03T08:19:11Z","timestamp":1585901951000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10044-004-0222-5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004,10,6]]},"references-count":37,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2004,12]]}},"alternative-id":["222"],"URL":"https:\/\/doi.org\/10.1007\/s10044-004-0222-5","relation":{},"ISSN":["1433-7541","1433-755X"],"issn-type":[{"value":"1433-7541","type":"print"},{"value":"1433-755X","type":"electronic"}],"subject":[],"published":{"date-parts":[[2004,10,6]]}}}