{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,1,24]],"date-time":"2023-01-24T16:56:20Z","timestamp":1674579380209},"reference-count":29,"publisher":"Association for Computing Machinery (ACM)","issue":"4","content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["J. ACM"],"published-print":{"date-parts":[[1991,10]]},"DOI":"10.1145\/115234.115366","type":"journal-article","created":{"date-parts":[[2002,7,27]],"date-time":"2002-07-27T11:25:57Z","timestamp":1027769157000},"page":"815-853","update-policy":"http:\/\/dx.doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":178,"title":["Faster scaling algorithms for general graph matching problems"],"prefix":"10.1145","volume":"38","author":[{"given":"Harold N.","family":"Gabow","sequence":"first","affiliation":[{"name":"Univ. of Colorado, Boulder"}]},{"given":"Robert E.","family":"Tarjan","sequence":"additional","affiliation":[{"name":"Princeton Univ., Princeton, NJ"}]}],"member":"320","published-online":{"date-parts":[[1991,10]]},"reference":[{"key":"e_1_2_1_1_2","volume-title":"The Design and Analysis of Computer Algorithms","author":"AHO A. V.","year":"1974","unstructured":"AHO . A. V. , HOPCROFT , J. E. , AND ULLMAN , J.D. The Design and Analysis of Computer Algorithms , Addison-Wesley , Reading, Mass ., 1974 . AHO. A. V., HOPCROFT, J. E., AND ULLMAN, J.D. The Design and Analysis of Computer Algorithms, Addison-Wesley, Reading, Mass., 1974."},{"key":"e_1_2_1_2_2","first-page":"4","article-title":"An analysis of alternative strategies for lmplementing matching algorithms","volume":"13","author":"BALL M. O.","year":"1983","unstructured":"BALL , M. O. , AND DERIGS , U . An analysis of alternative strategies for lmplementing matching algorithms . Networks 13 , 4 ( 1983 ), 517-549. BALL, M. O., AND DERIGS, U. An analysis of alternative strategies for lmplementing matching algorithms. Networks 13, 4 (1983), 517-549.","journal-title":"Networks"},{"key":"e_1_2_1_3_2","volume-title":"Mass., 1986; preliminary version. In Proceeding of the 25th Conference on Decision and Control. IEEE","author":"BERTSEKAS D.P.","year":"1986","unstructured":"BERTSEKAS , D.P. Distributed asynchronous relaxation methods for linear network flow problems, LIDS Report P-1606, M.I.T., Cambridge , Mass., 1986; preliminary version. In Proceeding of the 25th Conference on Decision and Control. IEEE , New York , December 1986 . BERTSEKAS, D.P. Distributed asynchronous relaxation methods for linear network flow problems, LIDS Report P-1606, M.I.T., Cambridge, Mass., 1986; preliminary version. In Proceeding of the 25th Conference on Decision and Control. IEEE, New York, December 1986."},{"key":"e_1_2_1_5_2","doi-asserted-by":"crossref","first-page":"50","DOI":"10.1007\/BFb0121194","article-title":"A primal algorithm for optimum matching","volume":"8","author":"CUNNINGHAM W. H.","year":"1978","unstructured":"CUNNINGHAM , W. H. , AND MARSH , A. B. III . A primal algorithm for optimum matching . Math. Prog. Stud. 8 ( 1978 ), 50 - 72 . CUNNINGHAM, W. H., AND MARSH, A. B. III. A primal algorithm for optimum matching. Math. Prog. Stud. 8 (1978), 50-72.","journal-title":"Math. Prog. Stud."},{"key":"e_1_2_1_6_2","doi-asserted-by":"crossref","first-page":"449","DOI":"10.4153\/CJM-1965-045-4","article-title":"Paths, trees and flowers","volume":"17","author":"EDMONDS J","year":"1965","unstructured":"EDMONDS , J . Paths, trees and flowers . Canad. J. Math. 17 ( 1965 ), 449 - 467 EDMONDS, J. Paths, trees and flowers. Canad. J. Math. 17 (1965), 449-467","journal-title":"Canad. J. Math."},{"key":"e_1_2_1_7_2","doi-asserted-by":"crossref","first-page":"125","DOI":"10.6028\/jres.069B.013","article-title":"Maximum matching and a polyhedron with 0, t-vertices","volume":"69","author":"EDMONDS J","year":"1965","unstructured":"EDMONDS , J . Maximum matching and a polyhedron with 0, t-vertices . J. Res. Nat. Bur. Standards 69B ( 1965 ), 125 - 130 . EDMONDS, J. Maximum matching and a polyhedron with 0, t-vertices. J. Res. Nat. Bur. Standards 69B (1965), 125-130.","journal-title":"J. Res. Nat. Bur. Standards"},{"key":"e_1_2_1_8_2","doi-asserted-by":"publisher","DOI":"10.1145\/321694.321699"},{"key":"e_1_2_1_9_2","doi-asserted-by":"publisher","DOI":"10.1145\/321941.321942"},{"key":"e_1_2_1_10_2","doi-asserted-by":"publisher","DOI":"10.1016\/0022-0000(85)90039-X"},{"key":"e_1_2_1_11_2","first-page":"90","volume-title":"Proceedings of the 26th Annual Symposium on Foundations of Computer Science. IEEE","author":"GABOW H.N.","year":"1985","unstructured":"GABOW , H.N. A scaling algorithm for weighted matching on general graphs . In Proceedings of the 26th Annual Symposium on Foundations of Computer Science. IEEE , New York , 1985 , pp. 90 - 100 . GABOW, H.N. A scaling algorithm for weighted matching on general graphs. In Proceedings of the 26th Annual Symposium on Foundations of Computer Science. IEEE, New York, 1985, pp. 90-100."},{"key":"e_1_2_1_12_2","unstructured":"GABOW H.N. Duality and parallel algorithms for graph matching manuscript. GABOW H.N. Duality and parallel algorithms for graph matching manuscript."},{"key":"e_1_2_1_13_2","first-page":"434","volume-title":"Proceedings of the 1st Annual A CM-SIAM Symposium on Discrete Algorithms. ACM","author":"GABOW H. N.","year":"1990","unstructured":"GABOW , H. N. Data structures for weighted matching and nearest common ancestors with linking . In Proceedings of the 1st Annual A CM-SIAM Symposium on Discrete Algorithms. ACM , New York , 1990 , pp. 434 - 443 . GABOW, H. N. Data structures for weighted matching and nearest common ancestors with linking. In Proceedings of the 1st Annual A CM-SIAM Symposium on Discrete Algorithms. ACM, New York, 1990, pp. 434-443."},{"key":"e_1_2_1_14_2","doi-asserted-by":"publisher","DOI":"10.1145\/65950.65954"},{"key":"e_1_2_1_15_2","doi-asserted-by":"crossref","first-page":"209","DOI":"10.1016\/0022-0000(85)90014-5","article-title":"A linear-time algorithm for a special case of disjoint set union","volume":"30","author":"GABOW H. N.","unstructured":"GABOW , H. N. , AND TARJAN , R. E . A linear-time algorithm for a special case of disjoint set union . J. Comp. and System Sci. , 30 , 2 (I985), 209 - 221 . GABOW, H. N., AND TARJAN, R. E. A linear-time algorithm for a special case of disjoint set union. J. Comp. and System Sci., 30, 2 (I985), 209-221.","journal-title":"J. Comp. and System Sci."},{"key":"e_1_2_1_16_2","doi-asserted-by":"publisher","DOI":"10.1016\/0196-6774(88)90031-4"},{"key":"e_1_2_1_17_2","doi-asserted-by":"publisher","DOI":"10.1137\/0218069"},{"key":"e_1_2_1_18_2","doi-asserted-by":"publisher","DOI":"10.1137\/0215009"},{"key":"e_1_2_1_19_2","volume-title":"Dept. of Electrical Eng. and Comp. Scl., MIT, Techmcal Rep. MIT\/LCS\/TR-374","author":"GOL BERG","year":"1987","unstructured":"GOL f) BERG , A. V. Efficient graph algorithms for sequenual and parallel computers. Ph. D. Dissertation , Dept. of Electrical Eng. and Comp. Scl., MIT, Techmcal Rep. MIT\/LCS\/TR-374 , Cambridge , Mass ., 1987 . GOLf)BERG, A. V. Efficient graph algorithms for sequenual and parallel computers. Ph. D. Dissertation, Dept. of Electrical Eng. and Comp. Scl., MIT, Techmcal Rep. MIT\/LCS\/TR-374, Cambridge, Mass., 1987."},{"key":"e_1_2_1_20_2","doi-asserted-by":"publisher","DOI":"10.1287\/moor.15.3.430"},{"key":"e_1_2_1_21_2","doi-asserted-by":"crossref","first-page":"4","DOI":"10.1137\/0202019","article-title":"algorithm tbr maximum matchings in bipartite graphs","volume":"2","author":"HOPCROFT J.","year":"1973","unstructured":"HOPCROFT , J. , AND KARP , R. An n5 '~ algorithm tbr maximum matchings in bipartite graphs , SIAM J. Comput. , 2 , 4 ( 1973 ), 225-231. HOPCROFT, J., AND KARP, R. An n5'~ algorithm tbr maximum matchings in bipartite graphs, SIAM J. Comput., 2, 4 (1973), 225-231.","journal-title":"SIAM J. Comput."},{"key":"e_1_2_1_22_2","volume-title":"Rinehart and Winston","author":"LAWLER E. L.","year":"1976","unstructured":"LAWLER , E. L. Combinatorial Optimization : Networks and Matroids. Holt , Rinehart and Winston , New York , 1976 . LAWLER, E. L. Combinatorial Optimization: Networks and Matroids. Holt, Rinehart and Winston, New York, 1976."},{"key":"e_1_2_1_23_2","volume-title":"Annals of Discrete Mathematics 29","author":"PLUYIM~R M.D.","year":"1986","unstructured":"Low(sz, L., AND PLUYIM~R , M.D. Matching Theory North-Holland Mathematical Studies 121 , Annals of Discrete Mathematics 29 , North-Holland , New York , 1986 . Low(sz, L., AND PLUYIM~R, M.D. Matching Theory North-Holland Mathematical Studies 121, Annals of Discrete Mathematics 29, North-Holland, New York, 1986."},{"key":"e_1_2_1_24_2","first-page":"I7","volume-title":"Proceedings of the 21st Annual Symposium on the Foundations of Computer Science. IEEE","author":"MICAL","year":"1980","unstructured":"MICAL ., S., AND V~ZIRAN~ , V V . An O( V\/{ V} \" I El) algorithm for finding maximum matching m general graphs . In Proceedings of the 21st Annual Symposium on the Foundations of Computer Science. IEEE , New York , 1980 , pp. I7 - 27 . MICAL., S., AND V~ZIRAN~, V V. An O( V\/{ V} \" I El) algorithm for finding maximum matching m general graphs. In Proceedings of the 21st Annual Symposium on the Foundations of Computer Science. IEEE, New York, 1980, pp. I7-27."},{"key":"e_1_2_1_25_2","volume-title":"Combinatorial Optimization: Algorithms and Complexlty","author":"PAPADIMITRI~ U, C","year":"1982","unstructured":"PAPADIMITRI~ ) U, C . H., AND STE 1G LITZ , K. Combinatorial Optimization: Algorithms and Complexlty . Prentice-Hall, Inc , Englcwood Cliffs, N.J. , 1982 . PAPADIMITRI~)U, C. H., AND STE1GLITZ, K. Combinatorial Optimization: Algorithms and Complexlty. Prentice-Hall, Inc , Englcwood Cliffs, N.J., 1982."},{"key":"e_1_2_1_26_2","doi-asserted-by":"publisher","DOI":"10.1007\/BF02579369"},{"key":"e_1_2_1_27_2","doi-asserted-by":"publisher","DOI":"10.1145\/322154.322161"},{"key":"e_1_2_1_28_2","series-title":"SIAM Monograph","doi-asserted-by":"crossref","DOI":"10.1137\/1.9781611970265","volume-title":"Data Structures and Network Algorithms","author":"TARJAN R.E.","year":"1983","unstructured":"TARJAN , R.E. Data Structures and Network Algorithms . SIAM Monograph , Philadelphia, Pa ., 1983 . TARJAN, R.E. Data Structures and Network Algorithms. SIAM Monograph, Philadelphia, Pa., 1983."},{"key":"e_1_2_1_29_2","first-page":"422","volume-title":"ACM","author":"AIDYA P. M.","year":"1988","unstructured":"V AIDYA , P. M. Geometry helps in matching In Proceeding of the 20th Annual A CM Symposium on Theory of Computing . ACM , New York , 1988 , pp 422 - 425 . 10.1145\/62212.62253 V AIDYA, P. M. Geometry helps in matching In Proceeding of the 20th Annual A CM Symposium on Theory of Computing. ACM, New York, 1988, pp 422-425. 10.1145\/62212.62253"},{"key":"e_1_2_1_30_2","doi-asserted-by":"crossref","first-page":"41","DOI":"10.1002\/net.3230110105","article-title":"BER, G.M. Sensitwaty analysis of optimal match~ngs","volume":"11","year":"1981","unstructured":"Wr. : BER, G.M. Sensitwaty analysis of optimal match~ngs , Networks 11 ( 1981 ), 41 - 56 . Wr.:BER, G.M. Sensitwaty analysis of optimal match~ngs, Networks 11 (1981), 41-56.","journal-title":"Networks"}],"container-title":["Journal of the ACM"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/115234.115366","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,12,28]],"date-time":"2022-12-28T20:19:07Z","timestamp":1672258747000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/115234.115366"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1991,10]]},"references-count":29,"journal-issue":{"issue":"4","published-print":{"date-parts":[[1991,10]]}},"alternative-id":["10.1145\/115234.115366"],"URL":"http:\/\/dx.doi.org\/10.1145\/115234.115366","relation":{},"ISSN":["0004-5411","1557-735X"],"issn-type":[{"value":"0004-5411","type":"print"},{"value":"1557-735X","type":"electronic"}],"subject":["Artificial Intelligence","Hardware and Architecture","Information Systems","Control and Systems Engineering","Software"],"published":{"date-parts":[[1991,10]]},"assertion":[{"value":"1991-10-01","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}