{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,22]],"date-time":"2025-03-22T00:10:18Z","timestamp":1742602218911,"version":"3.40.2"},"publisher-location":"Berlin, Heidelberg","reference-count":52,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540629092"},{"type":"electronic","value":"9783540690429"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1997]]},"DOI":"10.1007\/3-540-62909-2_85","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T22:56:06Z","timestamp":1330296966000},"page":"261-275","source":"Crossref","is-referenced-by-count":2,"title":["Deterministic search strategies for relational graph matching"],"prefix":"10.1007","author":[{"given":"Mark L.","family":"Williams","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Richard C.","family":"Wilson","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Edwin R.","family":"Hancock","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,6,7]]},"reference":[{"key":"17_CR1","doi-asserted-by":"crossref","first-page":"225","DOI":"10.1109\/34.485529","volume":"18","author":"Y. Amit","year":"1996","unstructured":"Amit Y. and A. Kong, \u201cGraphical Templates for Model Registration\u201d, IEEE PAMI, 18, pp. 225\u2013236, 1996.","journal-title":"IEEE PAMI"},{"key":"17_CR2","doi-asserted-by":"crossref","first-page":"83","DOI":"10.1016\/0020-0190(76)90049-1","volume":"4","author":"H.G. Barrow","year":"1976","unstructured":"Barrow H.G. and R.M Burstall, \u201cSubgraph Isomorphism, Matching Relational Structures and Maximal Cliques\u201d, Information Processing Letters, 4, pp. 83\u201384, 1976.","journal-title":"Information Processing Letters"},{"key":"17_CR3","unstructured":"Barrow H.G. and R.J. Popplestone, \u201cRelational Descriptions in Picture Processing\u201d, Machine Intelligence, 6, 1971."},{"key":"17_CR4","doi-asserted-by":"crossref","first-page":"144","DOI":"10.1109\/34.3880","volume":"10","author":"K. Boyer","year":"1988","unstructured":"Boyer K. and A. Kak, \u201cStructural Stereopsis for 3D Vision\u201d, IEEE PAMI, 10, pp 144\u2013166, 1988.","journal-title":"IEEE PAMI"},{"key":"17_CR5","doi-asserted-by":"crossref","unstructured":"Cross A.D.J. and E.R. Hancock, \u201cRelational Matching with Stochastic Optimisation\u201d IEEE International Symposium on Computer Vision, pp. 365\u2013370, 1995.","DOI":"10.1109\/ISCV.1995.477029"},{"key":"17_CR6","first-page":"514","volume":"1064","author":"A.D.J. Cross","year":"1996","unstructured":"Cross A.D.J., R.C. Wilson and E.R. Hancock, \u201cGenetic Search for structural matching\u201d, Proceedings ECCV96, LNCS 1064, pp. 514\u2013525, 1996.","journal-title":"Proceedings ECCV96, LNCS"},{"key":"17_CR7","doi-asserted-by":"crossref","unstructured":"Finch A.M., Wilson R.C. and Hancock E.R., \u201cMatching Delaunay Graphs\u201d, to appear in Pattern Recognition, 1996.","DOI":"10.1007\/3-540-60298-4_236"},{"key":"17_CR8","doi-asserted-by":"crossref","first-page":"359","DOI":"10.1109\/ICPR.1996.546849","volume":"II","author":"A.M. Finch","year":"1996","unstructured":"Finch A.M., Wilson R.C. and Hancock E.R., \u201cRelational Matching with Mean-Field Annealing\u201d, Proceedings of the 13th International Conferrence on Pattern Recognition, Volume II, pp. 359\u2013363, 1996.","journal-title":"Proceedings of the 13th International Conferrence on Pattern Recognition"},{"key":"17_CR9","unstructured":"Finch A.M., Wilson R.C. and Hancock E.R., \u201cSoftening Discrete Relaxation\u201d, to appear in Neural Information Processing Systems 9, MIT Press 1997."},{"key":"17_CR10","doi-asserted-by":"crossref","first-page":"114","DOI":"10.1109\/34.67642","volume":"13","author":"P.J. Flynn","year":"1991","unstructured":"Flynn P.J. and A.K. Jain, \u201cCAD-Based Vision \u2014 from CAD Models to Relational Graphs\u201d, IEEE PAMI, 13, pp 114\u2013132, 1991.","journal-title":"IEEE PAMI"},{"key":"17_CR11","doi-asserted-by":"crossref","first-page":"721","DOI":"10.1109\/TPAMI.1984.4767596","volume":"6","author":"D. Geman","year":"1984","unstructured":"Geman D. and S. Geman, \u201cStochastic Relaxation, Gibbs Distributions and Bayesian Restoration of Images\u201d, IEEE PAMI, 6, pp 721\u2013741, 1984.","journal-title":"IEEE PAMI"},{"key":"17_CR12","doi-asserted-by":"crossref","first-page":"401","DOI":"10.1109\/34.134040","volume":"13","author":"D. Geiger","year":"1991","unstructured":"Geiger D. and F. Girosi, \u201cParallel and Deterministic Algorithms from MRF's: Surface Reconstruction\u201d, IEEE PAMI, 13, pp 401\u2013412, 1991.","journal-title":"IEEE PAMI"},{"key":"17_CR13","doi-asserted-by":"crossref","first-page":"223","DOI":"10.1016\/0166-218X(94)00037-E","volume":"65","author":"F. Glover","year":"1996","unstructured":"Glover F., \u201cEjection chains, reference structures and alternating path methods for traveling salesman problems\u201d, Discrete Applied Mathematics, 65, pp. 223\u2013253, 1996.","journal-title":"Discrete Applied Mathematics"},{"key":"17_CR14","doi-asserted-by":"crossref","first-page":"290","DOI":"10.1007\/BF02125455","volume":"63","author":"E. Rolland","year":"1996","unstructured":"Rolland E., H. Pirkul and F. Glover, \u201cTabu search for graph partitioning\u201d, Annals of Operations Research, 63, pp. 290\u2013232, 1996.","journal-title":"Annals of Operations Research"},{"key":"17_CR15","first-page":"111","volume":"49","author":"F. Glover","year":"1995","unstructured":"Glover F., \u201cGenetic algorithms and tabu search \u2014 hybrids for optimisation\u201d, Discrete Applied Mathematics, 49, pp. 111\u2013134, 1995.","journal-title":"Discrete Applied Mathematics"},{"key":"17_CR16","doi-asserted-by":"crossref","first-page":"231","DOI":"10.1016\/0166-218X(94)90211-9","volume":"49","author":"F. Glover","year":"1995","unstructured":"Glover F., \u201cTabu search for nonlinear and parametric optimisation (with links to genetic algorithms)\u201d, Discrete Applied Mathematics, 49, pp. 231\u2013255, 1995.","journal-title":"Discrete Applied Mathematics"},{"key":"17_CR17","doi-asserted-by":"crossref","first-page":"787","DOI":"10.1162\/neco.1996.8.4.787","volume":"8","author":"S. Gold","year":"1996","unstructured":"Gold S., A. Rangarajan and E. Mjolsness, \u201cLearning with pre-knowledge: Clustering with point and graph-matching distance measures\u201d, Neural Computation, 8, pp. 787\u2013804, 1996.","journal-title":"Neural Computation"},{"key":"17_CR18","doi-asserted-by":"crossref","first-page":"377","DOI":"10.1109\/34.491619","volume":"18","author":"S. Gold","year":"1996","unstructured":"Gold S. and A. Rangarajan, \u201cA Graduated Assignment Algorithm for Graph Matching\u201d, IEEE PAMI, 18, pp. 377\u2013388, 1996.","journal-title":"IEEE PAMI"},{"key":"17_CR19","doi-asserted-by":"publisher","first-page":"711","DOI":"10.1016\/0031-3203(90)90094-2","volume":"23","author":"E.R. Hancock","year":"1990","unstructured":"Hancock E.R. and J. Kittler, \u201cDiscrete Relaxation,\u201d Pattern Recognition, 23, pp. 711\u2013733, 1990.","journal-title":"Pattern Recognition"},{"key":"17_CR20","first-page":"600","volume":"8","author":"R.M. Haralick","year":"1978","unstructured":"Haralick R.M. and J. Kartus, \u201cArrangements, Homomorphisms and Discrete Relaxation\u201d, IEEE SMC, 8, pp. 600\u2013612, 1978.","journal-title":"IEEE SMC"},{"key":"17_CR21","doi-asserted-by":"crossref","first-page":"173","DOI":"10.1109\/TPAMI.1979.4766903","volume":"1","author":"R.M. Haralick","year":"1979","unstructured":"Haralick R.M. and L.G. Shapiro, \u201cThe consistent labelling problem-part I\u201d, IEEE PAMI, 1, pp. 173\u2013184, 1979.","journal-title":"IEEE PAMI"},{"key":"17_CR22","doi-asserted-by":"crossref","first-page":"193","DOI":"10.1109\/TPAMI.1980.4767007","volume":"2","author":"R.M. Haralick","year":"1980","unstructured":"Haralick R.M. and L.G. Shapiro, \u201cThe consistent labelling problem-part II\u201d, IEEE PAMI, 2, pp. 193\u2013203, 1980.","journal-title":"IEEE PAMI"},{"key":"17_CR23","doi-asserted-by":"publisher","first-page":"263","DOI":"10.1016\/0004-3702(80)90051-X","volume":"14","author":"R.M. Haralick","year":"1980","unstructured":"Haralick R.M. and G. Elliott, \u201cIncreasing Tree Search Efficiency for Constraint Satisfaction Problems\u201d Artificial Intelligence, 14, pp. 263\u2013313, 1980.","journal-title":"Artificial Intelligence"},{"key":"17_CR24","doi-asserted-by":"crossref","DOI":"10.21236\/AD0705364","volume-title":"Graph Theory","author":"F. Harary","year":"1969","unstructured":"Harary F., \u201cGraph Theory\u201d, Addison Wesley, Reading, MA, 1969."},{"key":"17_CR25","unstructured":"Henderson T.C., \u201cDiscrete Relaxation Techniques\u201d, Oxford University Press, 1990."},{"key":"17_CR26","doi-asserted-by":"crossref","unstructured":"Horaud R., F.Veilon and T.Skordas, \u201cFinding Geometric and Relational Structures in an Image\u201d, Proceedings of the First European Conference on Computer Vision, pp 374\u2013384, 1990.","DOI":"10.1007\/BFb0014886"},{"key":"17_CR27","doi-asserted-by":"crossref","first-page":"1168","DOI":"10.1109\/34.42855","volume":"11","author":"R. Horaud","year":"1989","unstructured":"Horaud R. and T. Skordas, \u201cStereo Correspondence through Feature Grouping and Maximal Cliques\u201d, IEEE PAMI, 11, pp. 1168\u20131180, 1989.","journal-title":"IEEE PAMI"},{"key":"17_CR28","doi-asserted-by":"crossref","unstructured":"Herault L., R. Horaud, F. Veillon and J-J. Niez, \u201cSymbolic Image Matching by Simulated Annealing\u201d, Proceedings of First British Machine Vision Conference, pp. 319\u2013324, 1990.","DOI":"10.5244\/C.4.57"},{"key":"17_CR29","doi-asserted-by":"crossref","first-page":"267","DOI":"10.1109\/TPAMI.1983.4767390","volume":"5","author":"R.A. Hummel","year":"1983","unstructured":"Hummel R.A. and S. W. Zucker, \u201cOn the foundations of relaxation processes\u201d, IEEE PAMI, 5, pp. 267\u2013287, 1983.","journal-title":"IEEE PAMI"},{"key":"17_CR30","doi-asserted-by":"crossref","unstructured":"Kittler J., W.J. Christmas and M.Petrou, \u201cProbabilistic Relaxation for Matching Problems in Machine Vision\u201d, Proceedings of the Fourth International Conference on Computer Vision, pp. 666\u2013674, 1993.","DOI":"10.1109\/ICCV.1993.378148"},{"key":"17_CR31","doi-asserted-by":"publisher","first-page":"477","DOI":"10.1016\/0893-6080(94)90081-7","volume":"7","author":"J.J. Kosowsky","year":"1994","unstructured":"Kosowsky J.J. and Yuille A.L., \u201cThe Invisible Hand Algorithm: Solving the Assignment Problem with Statistical Physics\u201d, Neural Networks, 7, pp 477\u2013490, 1994.","journal-title":"Neural Networks"},{"key":"17_CR32","doi-asserted-by":"publisher","first-page":"300","DOI":"10.1109\/12.210173","volume":"42","author":"M. Lades","year":"1992","unstructured":"Lades M., J.C. Vorbruggen, J. Buhmann, J. Lange, C. von der Malsburg, R.P. Wurtz and W. Konen, \u201cDistortion Invariant Object Recognition in the Dynamic Link Architecture\u201d, IEEE Transactions on Computers, 42, pp. 300\u2013311, 1992.","journal-title":"IEEE Transactions on Computers"},{"key":"17_CR33","doi-asserted-by":"publisher","first-page":"583","DOI":"10.1016\/0031-3203(92)90075-T","volume":"25","author":"S.Z. Li","year":"1992","unstructured":"Li S.Z., \u201cMatching Invariant to Translations, Rotations and Scale Changes\u201d, Pattern Recognition, 25, pp. 583\u2013594, 1992.","journal-title":"Pattern Recognition"},{"key":"17_CR34","unstructured":"Messmer B.T. and Bunke H., \u201cEfficient Error-tolerant Subgraph Isomorphism Detection\u201d, Shape, Structure and Pattern Recognition, Edited by D. Dori and A. Bruchstein, pp. 231\u2013240, 1995."},{"key":"17_CR35","doi-asserted-by":"crossref","first-page":"218","DOI":"10.1162\/neco.1989.1.2.218","volume":"1","author":"E. Mjolsness","year":"1989","unstructured":"Mjolsness E., G. Gindi and P. Anandan, \u201cOptimisation in model matching and perceptual organisation\u201d, Neural Computation, 1, pp. 218\u2013219, 1989.","journal-title":"Neural Computation"},{"key":"17_CR36","doi-asserted-by":"crossref","first-page":"533","DOI":"10.4153\/CJM-1965-053-6","volume":"17","author":"T.S. Motzkin","year":"1965","unstructured":"Motzkin T.S. and E.G. Straus, \u201cMaxima for graphs and a new proof of a theorem of Turan\u201d, Canadian Journal of Mathematics, 17, pp. 533\u2013540, 1965.","journal-title":"Canadian Journal of Mathematics"},{"key":"17_CR37","volume-title":"Problem solving Methods in Artificial Intelligence","author":"N.J. Nilsson","year":"1971","unstructured":"Nilsson N.J., \u201cProblem solving Methods in Artificial Intelligence\u201d, McGraw-Hill, New York, 1971."},{"key":"17_CR38","first-page":"353","volume":"13","author":"A. Sanfeliu","year":"1983","unstructured":"Sanfeliu A. and Fu K.S., \u201cA Distance Measure Between Attributed Relational Graphs for Pattern Recognition\u201d, IEEE SMC, 13, pp 353\u2013362, 1983.","journal-title":"IEEE SMC"},{"key":"17_CR39","first-page":"382","volume":"23","author":"S. Sarker","year":"1993","unstructured":"Sarker S. and K.L. Boyer, \u201cPerceptual Organisation in Computer Vision: A Review and Proposal for a Classificatory Structure\u201d, IEEE SMC, 23, pp 382\u2013399, 1993.","journal-title":"IEEE SMC"},{"key":"17_CR40","doi-asserted-by":"crossref","first-page":"504","DOI":"10.1109\/TPAMI.1981.4767144","volume":"3","author":"L.G. Shapiro","year":"1981","unstructured":"Shapiro L.G. and R.M. Haralick, \u201cStructural Description and Inexact Matching\u201d, IEEE PAMI, 3, pp 504\u2013519, 1981.","journal-title":"IEEE PAMI"},{"key":"17_CR41","doi-asserted-by":"crossref","first-page":"90","DOI":"10.1109\/TPAMI.1985.4767621","volume":"7","author":"L.G. Shapiro","year":"1985","unstructured":"Shapiro L.G. and R.M. Haralick, \u201cA Metric for Comparing Relational Descriptions\u201d, IEEE PAMI, 7, pp 90\u201394, 1985.","journal-title":"IEEE PAMI"},{"key":"17_CR42","doi-asserted-by":"crossref","first-page":"268","DOI":"10.1162\/neco.1991.3.2.268","volume":"3","author":"P. Simic","year":"1991","unstructured":"Simic P., \u201cConstrained nets for graph matching and other quadratic assignment problems\u201d, Neural Computation, 3, pp. 268\u2013281, 1991.","journal-title":"Neural Computation"},{"key":"17_CR43","doi-asserted-by":"publisher","first-page":"997","DOI":"10.1016\/0031-3203(94)00166-J","volume":"28","author":"P.N. Suganathan","year":"1995","unstructured":"Suganathan P.N., E.K. Teoh and D.P. Mital, \u201cPattern Recognition by Graph Matching using Potts MFT Networks\u201d, Pattern Recognition, 28, pp. 997\u20131009, 1995.","journal-title":"Pattern Recognition"},{"key":"17_CR44","first-page":"115","volume":"22","author":"Y.C. Tang","year":"1992","unstructured":"Tang Y.C. and C.S.G. Lee, \u201cA Geometric Feature Relation Graph Formalism for Consistent Sensor Fusion\u201d, IEEE SMC, 22, pp 115\u2013129, 1992.","journal-title":"IEEE SMC"},{"key":"17_CR45","doi-asserted-by":"crossref","first-page":"583","DOI":"10.1016\/S0019-9958(66)80017-7","volume":"9","author":"J.R. Ullman","year":"1966","unstructured":"Ullman J.R., \u201cAssociating parts of patterns\u201d, Information and Control, 9, pp. 583\u2013601, 1966.","journal-title":"Information and Control"},{"key":"17_CR46","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1145\/321921.321925","volume":"23","author":"J.R. Ullman","year":"1976","unstructured":"Ullman J.R., \u201cAn algorithm for subgraph isomorphism\u201d, Journal of the ACM, 23, 31\u201342, 1976.","journal-title":"Journal of the ACM"},{"key":"17_CR47","doi-asserted-by":"crossref","unstructured":"Wilson R.C. and E.R Hancock, \u201cGraph Matching by Discrete Relaxation\u201d, Pattern Recognition in Practice IV: Multiple Paradigms, Comparative Studies and Hybrid Systems, North Holland pp. 165\u2013177, 1994.","DOI":"10.1016\/B978-0-444-81892-8.50019-5"},{"key":"17_CR48","doi-asserted-by":"publisher","first-page":"411","DOI":"10.1016\/0262-8856(95)99728-J","volume":"13","author":"R.C Wilson","year":"1995","unstructured":"Wilson R.C, A.N. Evans and E.R Hancock, \u201cRelational Matching by Discrete Relaxation\u201d, Image and Vision Computing, 13, pp. 411\u2013422, 1995.","journal-title":"Image and Vision Computing"},{"key":"17_CR49","doi-asserted-by":"publisher","first-page":"263","DOI":"10.1016\/0167-8655(95)00115-8","volume":"17","author":"R.C. Wilson","year":"1996","unstructured":"Wilson R.C. and E.R. Hancock, \u201cA Bayesian Compatibility Model for Graph Matching\u201d, Pattern Recognition Letters, 17, pp. 263\u2013276, 1996.","journal-title":"Pattern Recognition Letters"},{"key":"17_CR50","unstructured":"Yang D. and J. Kittler, \u201cMFT-Based Discrete Relaxation for Matching High-Order Relational Structures\u201d, Proceedings 12th International Conference on Pattern Recognition, pp. 219\u2013223, 1994."},{"key":"17_CR51","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1162\/neco.1990.2.1.1","volume":"2","author":"A. Yuille","year":"1990","unstructured":"Yuille A., \u201cGeneralised Deformable Models, Statistical Physics and Matching Problems\u201d, Neural Computation, 2, pp. 1\u201324, 1990.","journal-title":"Neural Computation"},{"key":"17_CR52","doi-asserted-by":"crossref","first-page":"341","DOI":"10.1162\/neco.1994.6.3.341","volume":"6","author":"A.L. Yuille","year":"1994","unstructured":"Yuille A.L. and Kosowsky J.J., \u201cStatistical Physics Algorithms that Converge\u201d, Nueral Computation, 6, pp 341\u2013356, 1994.","journal-title":"Nueral Computation"}],"container-title":["Lecture Notes in Computer Science","Energy Minimization Methods in Computer Vision and Pattern Recognition"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-62909-2_85.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,3,21]],"date-time":"2025-03-21T23:33:41Z","timestamp":1742600021000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-62909-2_85"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1997]]},"ISBN":["9783540629092","9783540690429"],"references-count":52,"URL":"https:\/\/doi.org\/10.1007\/3-540-62909-2_85","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1997]]}}}