{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,18]],"date-time":"2025-05-18T04:43:47Z","timestamp":1747543427297},"reference-count":31,"publisher":"Elsevier BV","issue":"1-2","license":[{"start":{"date-parts":[[1983,3,1]],"date-time":"1983-03-01T00:00:00Z","timestamp":415324800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Artificial Intelligence"],"published-print":{"date-parts":[[1983,3]]},"DOI":"10.1016\/s0004-3702(83)80012-5","type":"journal-article","created":{"date-parts":[[2006,12,3]],"date-time":"2006-12-03T07:12:21Z","timestamp":1165129941000},"page":"245-269","source":"Crossref","is-referenced-by-count":10,"title":["Efficient graph automorphism by vertex partitioning"],"prefix":"10.1016","volume":"21","author":[{"given":"Glenn","family":"Fowler","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Robert","family":"Haralick","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"F. Gail","family":"Gray","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Charles","family":"Feustel","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Charles","family":"Grinstead","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"issue":"10","key":"10.1016\/S0004-3702(83)80012-5_bib1","doi-asserted-by":"crossref","first-page":"610","DOI":"10.1109\/TSMC.1980.4308365","article-title":"Refined vertex codes and vertex partitioning methodology for graph isomorphism testing","volume":"10","author":"Bhat","year":"1980","journal-title":"IEEE Trans. Systems Man Cybernet."},{"issue":"11","key":"10.1016\/S0004-3702(83)80012-5_bib2","doi-asserted-by":"crossref","first-page":"651","DOI":"10.1145\/361219.361224","article-title":"Backtrack programming techniques","volume":"18","author":"Bitner","year":"1975","journal-title":"Comm. ACM"},{"key":"10.1016\/S0004-3702(83)80012-5_bib3","series-title":"Proc. SPIE Tech. Symp. Imaging and Assembly","article-title":"Robust feature matching through maximal cliques","author":"Bolles","year":"1979"},{"issue":"5","key":"10.1016\/S0004-3702(83)80012-5_bib4","doi-asserted-by":"crossref","first-page":"371","DOI":"10.1016\/0031-3203(81)90093-5","article-title":"A subgraph isomorphism algorithm using resolution","volume":"13","author":"Chen","year":"1981","journal-title":"Pattern Recognition"},{"issue":"1","key":"10.1016\/S0004-3702(83)80012-5_bib5","doi-asserted-by":"crossref","first-page":"51","DOI":"10.1145\/321556.321562","article-title":"An efficient algorithm for graph isomorphism","volume":"17","author":"Corneil","year":"1970","journal-title":"J. ACM"},{"key":"10.1016\/S0004-3702(83)80012-5_bib6","series-title":"Proc. International Conf. Artificial Intelligence","first-page":"457","article-title":"A general backtrack algorithm that eliminates most redundant tests","author":"Gaschnig","year":"1977"},{"key":"10.1016\/S0004-3702(83)80012-5_bib7","doi-asserted-by":"crossref","first-page":"95","DOI":"10.1002\/jgt.3190030202","article-title":"Further annotated bibliography on the isomorphism disease","volume":"3","author":"Gati","year":"1979","journal-title":"J. Graph Theory"},{"issue":"4","key":"10.1016\/S0004-3702(83)80012-5_bib8","doi-asserted-by":"crossref","first-page":"181","DOI":"10.1109\/TSMC.1980.4308468","article-title":"Graph optimal monomorphism algorithms","volume":"10","author":"Ghahraman","year":"1980","journal-title":"IEEE Trans. Systems Man Cybernet."},{"key":"10.1016\/S0004-3702(83)80012-5_bib9","doi-asserted-by":"crossref","first-page":"263","DOI":"10.1016\/0004-3702(80)90051-X","article-title":"Increasing tree search efficiency for constraint satisfaction problems","author":"Haralick","year":"1980","journal-title":"Artificial Intelligence"},{"issue":"2","key":"10.1016\/S0004-3702(83)80012-5_bib10","doi-asserted-by":"crossref","first-page":"173","DOI":"10.1109\/TPAMI.1979.4766903","article-title":"The consistent labeling problem I","volume":"1","author":"Haralick","year":"1979","journal-title":"IEEE Trans. Pattern Anal. Machine Intelligence"},{"issue":"3","key":"10.1016\/S0004-3702(83)80012-5_bib11","doi-asserted-by":"crossref","first-page":"193","DOI":"10.1109\/TPAMI.1980.4767007","article-title":"The consistent labeling problem II","volume":"2","author":"Haralick","year":"1980","journal-title":"IEEE Trans. Pattern Anal. Machine Intelligence"},{"key":"10.1016\/S0004-3702(83)80012-5_bib12","series-title":"Complexity of Computer Computations","first-page":"85","article-title":"Reducibility among combinatorial problems","author":"Karp","year":"1972"},{"key":"10.1016\/S0004-3702(83)80012-5_bib13","doi-asserted-by":"crossref","first-page":"45","DOI":"10.1002\/net.1975.5.1.45","article-title":"On the computational complexity of combinatorial problems","volume":"5","author":"Karp","year":"1975","journal-title":"Networks"},{"key":"10.1016\/S0004-3702(83)80012-5_bib14","series-title":"Proc. 25th Summer Meeting Canadian Mathematical Congress","first-page":"471","article-title":"Graph isomorphism using vertex adjacency matrices","author":"Kuhn","year":"1971"},{"key":"10.1016\/S0004-3702(83)80012-5_bib15","doi-asserted-by":"crossref","first-page":"291","DOI":"10.1007\/BF02253334","article-title":"Graph isomorphism: a heuristic edge-partitioning-oriented algorithm","volume":"12","author":"Levi","year":"1974","journal-title":"Computing"},{"key":"10.1016\/S0004-3702(83)80012-5_bib16","series-title":"Proc. Ninth Conf. Combinatorics, Graph Theory, and Computing","first-page":"499","article-title":"Sample graphs for isomorphism testing","author":"Mathon","year":"1978"},{"key":"10.1016\/S0004-3702(83)80012-5_bib17","doi-asserted-by":"crossref","first-page":"1588","DOI":"10.1063\/1.1705069","article-title":"On ordering and identifying undirected linear graphs","volume":"7","author":"Nagle","year":"1968","journal-title":"J. Math. Phys."},{"key":"10.1016\/S0004-3702(83)80012-5_bib18","article-title":"The undirected binary n-cube microprocessor array","volume":"6","author":"Pease","year":"1977","journal-title":"IEEE Trans. Comput."},{"key":"10.1016\/S0004-3702(83)80012-5_bib19","doi-asserted-by":"crossref","first-page":"339","DOI":"10.1002\/jgt.3190010410","article-title":"The graph isomorphism disease","volume":"1","author":"Read","year":"1977","journal-title":"Graph Theory"},{"issue":"3","key":"10.1016\/S0004-3702(83)80012-5_bib20","doi-asserted-by":"crossref","first-page":"433","DOI":"10.1145\/321958.321963","article-title":"A fast back-tracking algorithm to test directed graphs for isomorphism using distance matrices","volume":"23","author":"Schmidt","year":"1976","journal-title":"J. ACM"},{"issue":"5","key":"10.1016\/S0004-3702(83)80012-5_bib21","doi-asserted-by":"crossref","first-page":"313","DOI":"10.1109\/TSMC.1974.5409142","article-title":"Optimum features and graph isomorphism","volume":"4","author":"Shah","year":"1974","journal-title":"IEEE Trans. Systems Man Cybernet."},{"key":"10.1016\/S0004-3702(83)80012-5_bib22","article-title":"Linearization and standardization of graphs","author":"Stockton","year":"1968","journal-title":"Shell Development Co. Tech. Progress Rept. No.2-68, Project No. 34430"},{"key":"10.1016\/S0004-3702(83)80012-5_bib23","doi-asserted-by":"crossref","first-page":"36","DOI":"10.1021\/c160016a007","article-title":"A graph-theoretic algorithm for matching chemical structures","volume":"5","author":"Sussenguth","year":"1965","journal-title":"J. Chem. Doc."},{"key":"10.1016\/S0004-3702(83)80012-5_bib24","doi-asserted-by":"crossref","first-page":"520","DOI":"10.1137\/0116041","article-title":"Generalized matrix functions and the graph isomorphism problem","volume":"16","author":"Turner","year":"1968","journal-title":"SIAM J. Appl. Math."},{"key":"10.1016\/S0004-3702(83)80012-5_bib25","series-title":"Proof Techniques in Graph theory","article-title":"Key-word indexed bibliography of graph theory","author":"Turner","year":"1969"},{"key":"10.1016\/S0004-3702(83)80012-5_bib26","first-page":"198","author":"Ullmann","year":"1973"},{"issue":"1","key":"10.1016\/S0004-3702(83)80012-5_bib27","doi-asserted-by":"crossref","first-page":"31","DOI":"10.1145\/321921.321925","article-title":"An algorithm for subgraph isomorphism","volume":"23","author":"Ullmann","year":"1976","journal-title":"J. ACM"},{"issue":"1","key":"10.1016\/S0004-3702(83)80012-5_bib28","doi-asserted-by":"crossref","first-page":"26","DOI":"10.1145\/363872.363899","article-title":"Git\u2014a heuristic program for testing pairs of directed line graphs for isomorphism","volume":"7","author":"Unger","year":"1974","journal-title":"Comm. ACM"},{"key":"10.1016\/S0004-3702(83)80012-5_bib29","series-title":"The Psychology of Computer Vision","article-title":"Generating semantic descriptions from drawings of scenes with shadows","author":"Waltz","year":"1975"},{"key":"10.1016\/S0004-3702(83)80012-5_bib30","article-title":"On construction and identification of graphs","volume":"558","author":"Weisfeiler","year":"1976"},{"key":"10.1016\/S0004-3702(83)80012-5_bib31","article-title":"Relational descriptions in picture processing","volume":"6","author":"Barrow","year":"1971"}],"container-title":["Artificial Intelligence"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0004370283800125?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0004370283800125?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,2,7]],"date-time":"2019-02-07T07:41:00Z","timestamp":1549525260000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0004370283800125"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1983,3]]},"references-count":31,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[1983,3]]}},"alternative-id":["S0004370283800125"],"URL":"https:\/\/doi.org\/10.1016\/s0004-3702(83)80012-5","relation":{},"ISSN":["0004-3702"],"issn-type":[{"value":"0004-3702","type":"print"}],"subject":[],"published":{"date-parts":[[1983,3]]}}}