{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,9]],"date-time":"2026-05-09T04:14:34Z","timestamp":1778300074030,"version":"3.51.4"},"publisher-location":"Berlin, Heidelberg","reference-count":18,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540404521","type":"print"},{"value":"9783540450283","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2003]]},"DOI":"10.1007\/3-540-45028-9_2","type":"book-chapter","created":{"date-parts":[[2007,11,13]],"date-time":"2007-11-13T17:49:43Z","timestamp":1194976183000},"page":"13-23","source":"Crossref","is-referenced-by-count":25,"title":["On Graphs with Unique Node Labels"],"prefix":"10.1007","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":[[2003,6,24]]},"reference":[{"key":"2_CR1","doi-asserted-by":"crossref","unstructured":"IEEE Trans. PAMI, Special Section on Graph Algorithms and Computer Vision, Vol. 23(10), 2001, 1049\u20131151","DOI":"10.1109\/TPAMI.2001.954597"},{"key":"2_CR2","unstructured":"Pattern Recognition Letters, Special Issue on Graph Based Representation, 2003, to appear"},{"key":"2_CR3","first-page":"45","volume":"30","author":"B.D. McKay","year":"1981","unstructured":"McKay, B.D.: Practical Graph Isomorphism, Congressus Numerantium, Vol. 30, 1981, 45\u201387","journal-title":"Congressus Numerantium"},{"issue":"1","key":"2_CR4","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1145\/321921.321925","volume":"23","author":"J.R. Ullman","year":"1976","unstructured":"Ullman, J.R.: An algorihm for subgraph isomorphism, Journal of the ACM, Vol. 23(1), 1976, 31\u201342","journal-title":"Journal of the ACM"},{"key":"2_CR5","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1002\/spe.4380120103","volume":"12","author":"J. McGregor","year":"1982","unstructured":"McGregor, J.: Backtrack search algorithms and the maximal common subgraph problem, Software-Practice and Experience, Vol. 12, 1982, 23\u201313","journal-title":"Software-Practice and Experience"},{"key":"2_CR6","doi-asserted-by":"crossref","unstructured":"Levi, G.: A note on the derivation of maximal common subgraphs of two directed or undirected graphs, Calcolo 9, 1972, 341\u2013354","DOI":"10.1007\/BF02575586"},{"issue":"3","key":"2_CR7","first-page":"353","volume":"13","author":"A. Sanfeliu","year":"1983","unstructured":"Sanfeliu, A., Fu, K.S.: A Distance Measure Between Attributed Relational Graphs for Pattern Recognition, IEEE Trans. SMC, Vol. 13(3), 1983, 353\u2013363","journal-title":"IEEE Trans. SMC"},{"issue":"5","key":"2_CR8","doi-asserted-by":"crossref","first-page":"493","DOI":"10.1109\/34.682179","volume":"20","author":"B.T. Messmer","year":"1998","unstructured":"Messmer, B.T., Bunke, H.: A New Algorithm for Error-Tolerant Subgraph Isomorphism Detection, IEEE Trans. PAMI, Vol. 20(5), 1998, 493\u2013507","journal-title":"IEEE Trans. PAMI"},{"key":"2_CR9","unstructured":"Cordella, L.P., Foggia, P., Sansome, C., Vento, M.: An Improved Algorithm for Matching Large Graphs, Proceedings of the 3rd IAPR-TC15 Workshop on Graphbased Representations in Pattern Recognition, 2001, 149\u2013159"},{"key":"2_CR10","doi-asserted-by":"publisher","first-page":"403","DOI":"10.1017\/S0960129501003577","volume":"12","author":"J. Larrosa","year":"2002","unstructured":"Larrosa, J., Valiente, G.: Constraint satisfaction algorithms for graph pattern matching, Math. Struct. in Computer Science, Vol. 12, 2002, 403\u2013422","journal-title":"Math. Struct. in Computer Science"},{"issue":"8","key":"2_CR11","doi-asserted-by":"crossref","first-page":"749","DOI":"10.1109\/34.400565","volume":"17","author":"W.J. Christmas","year":"1995","unstructured":"Christmas, W.J., Kittler, J., Petrou, M.: Structural matching in computer vision using probabilistic relaxation, IEEE Trans. PAMI, Vol. 17(8), 1995, 749\u2013764","journal-title":"IEEE Trans. PAMI"},{"issue":"4","key":"2_CR12","first-page":"588","volume":"27","author":"I. Wang","year":"1997","unstructured":"Wang, I., Fan, K-C., Horng, J-T.: Genetic-based search for error-correcting graph isomorphism, IEEE Trans. SMC, Vol. 27(4), 1997, 588\u2013597","journal-title":"IEEE Trans. SMC"},{"key":"2_CR13","doi-asserted-by":"crossref","unstructured":"Hopcroft, J. E., Wong, J.: Linear time algorithm for isomorphism of planar graphs, Proceedings of the 6th Annual ACM Symposium on Theory of Computing, 1974, 172\u2013184","DOI":"10.1145\/800119.803896"},{"key":"2_CR14","doi-asserted-by":"publisher","first-page":"42","DOI":"10.1016\/0022-0000(82)90009-5","volume":"25","author":"E.M. Luks","year":"1982","unstructured":"Luks, E.M.: Isomorphism of Graphs of Bounded Valence Can Be Tested In Polynomial Time, Journal of Computer and Systems Sciences, Vol. 25, 1982, 42\u201365","journal-title":"Journal of Computer and Systems Sciences"},{"issue":"11","key":"2_CR15","doi-asserted-by":"crossref","first-page":"1535","DOI":"10.1109\/TPAMI.2002.1046176","volume":"24","author":"M. Pelillo","year":"2002","unstructured":"Pelillo, M.: Matching Free Trees, Maximal Cliques and Monotone Game Dynamics, IEEE Trans. PAMI, Vol. 24(11), 2002, 1535\u20131541","journal-title":"IEEE Trans. PAMI"},{"key":"2_CR16","unstructured":"Schenker, A., Last, M., Bunke, H., Kandel, A.: Clustering of web documents using a graph model, In Antonacopoulos, A., Hu, Jianying (eds), Web Document Analysis: Challenges and Opportunities, World Scientific, 2003, to appear"},{"key":"2_CR17","doi-asserted-by":"crossref","first-page":"917","DOI":"10.1109\/34.790431","volume":"21","author":"H. Bunke","year":"1999","unstructured":"Bunke, H.: Error correcting graph matching: on the influence of the underlying cost function, IEEE Trans. PAMI, Vol. 21, 1999, 917\u2013922","journal-title":"IEEE Trans. PAMI"},{"key":"2_CR18","doi-asserted-by":"publisher","first-page":"85","DOI":"10.1142\/S0219265902000562","volume":"3","author":"P.J. Shoubridge","year":"2002","unstructured":"Shoubridge, P.J., Kraetzl, M., Wallis, W.D., Bunke, H.: Abnormal Change Detection of Abnormal Change in a Time Series of Graphs, Journal of Interconnection Networks, Vol. 3, 2002, 85\u2013101","journal-title":"Journal of Interconnection Networks"}],"container-title":["Lecture Notes in Computer Science","Graph Based Representations in Pattern Recognition"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-45028-9_2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,4]],"date-time":"2019-05-04T07:21:39Z","timestamp":1556954499000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-45028-9_2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003]]},"ISBN":["9783540404521","9783540450283"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/3-540-45028-9_2","relation":{},"ISSN":["0302-9743"],"issn-type":[{"value":"0302-9743","type":"print"}],"subject":[],"published":{"date-parts":[[2003]]}}}