{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,7,24]],"date-time":"2024-07-24T07:10:54Z","timestamp":1721805054862},"reference-count":34,"publisher":"Informa UK Limited","issue":"2-3","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Parallel Algorithms and Applications"],"published-print":{"date-parts":[[1995,1]]},"DOI":"10.1080\/10637199508915506","type":"journal-article","created":{"date-parts":[[2007,7,7]],"date-time":"2007-07-07T06:51:49Z","timestamp":1183791109000},"page":"143-166","source":"Crossref","is-referenced-by-count":2,"title":["THE MAXIMUM WEIGHT PERFECT MATCHING PROBLEM FOR COMPLETE WEIGHTED GRAPHS IS IN PC\u2217\u2020"],"prefix":"10.1080","volume":"6","author":[{"given":"CONSTANTINE N.K.","family":"OSIAKWAN","sequence":"first","affiliation":[]},{"given":"SELIM G.","family":"AKL","sequence":"additional","affiliation":[]}],"member":"301","reference":[{"key":"CIT0001","volume-title":"The Design and Analysis of Parallel Algorithms","author":"Akl S. G.","year":"1989"},{"key":"CIT0002","doi-asserted-by":"publisher","DOI":"10.1016\/0020-0190(84)90128-5"},{"key":"CIT0003","doi-asserted-by":"publisher","DOI":"10.1016\/0022-0000(84)90003-5"},{"key":"CIT0004","doi-asserted-by":"crossref","unstructured":"B. Awerbuch , A. Isreali and Y. Shiloach , Finding Euler circuits in logarithmic parallel time ,Proc. of the 16th Annual ACM Symp. on Theory of Computing, Washington , DC , April 30\u2013May 2 , 1984 , 249 \u2013 257 .","DOI":"10.1145\/800057.808688"},{"key":"CIT0005","doi-asserted-by":"publisher","DOI":"10.1137\/0206054"},{"key":"CIT0006","doi-asserted-by":"publisher","DOI":"10.1145\/321812.321815"},{"key":"CIT0007","doi-asserted-by":"publisher","DOI":"10.1145\/322234.322243"},{"key":"CIT0008","first-page":"98","author":"Chandra A. K.","year":"1976","journal-title":"Proc. of the 17th Symp. on Foundations of Computer Science"},{"key":"CIT0009","doi-asserted-by":"publisher","DOI":"10.1137\/0217009"},{"key":"CIT0010","first-page":"78","volume-title":"Lecture Notes in Computer Science","volume":"158","author":"Cook S. A.","year":"1983"},{"key":"CIT0011","doi-asserted-by":"publisher","DOI":"10.1016\/0020-0190(79)90152-2"},{"key":"CIT0012","doi-asserted-by":"crossref","first-page":"1343","DOI":"10.1145\/50087.50096","volume":"31","author":"Driscoll J. R.","year":"1988","journal-title":"Communications of the Association for Computing Machinery"},{"key":"CIT0013","doi-asserted-by":"publisher","DOI":"10.1007\/BF01580113"},{"key":"CIT0014","first-page":"125","volume":"69","author":"Edmonds J.","year":"1965","journal-title":"Journal of Research of the National Bureau of Standards B. Mathematics and Mathematical Physics"},{"key":"CIT0015","unstructured":"H. N. Gabow , Data structures for weighted matching and nearest common ancestors with linking ,Proc. of the 1st Annual ACM-SIAM Symp. on Discrete Algorithms, San Francisco , CA , 1990 , 434 \u2013 443 ."},{"key":"CIT0016","doi-asserted-by":"crossref","first-page":"540","DOI":"10.1145\/65950.65954","volume":"36","author":"Gabow H. N.","year":"1989","journal-title":"Journal of the Association for Computing Machinery"},{"key":"CIT0017","doi-asserted-by":"crossref","unstructured":"H. N. Gabow and R. E. Tarjan , Almost-optimum speed-ups of algorithms for bipartite matching and related problems ,Proc. of the 20th Annual ACM Symp. on Theory of Computing, ACM , New York , 1988 , 514 \u2013 527 .","DOI":"10.1145\/62212.62263"},{"key":"CIT0018","unstructured":"H. N. Gabow , Implementation of algorithms for maximum matching on nonbipartite graphs , Ph.D. dissertation , Department of Computer Science, Stanford University , Stanford , CA , 1974 ."},{"key":"CIT0019","doi-asserted-by":"publisher","DOI":"10.1137\/0215009"},{"key":"CIT0020","doi-asserted-by":"publisher","DOI":"10.1007\/BF02122800"},{"key":"CIT0021","volume-title":"Computer and Intractability A Guide to the Theory of NP-Completeness","author":"Garey M. R.","year":"1979"},{"key":"CIT0022","doi-asserted-by":"crossref","unstructured":"A. V. Goldberg , S. A. Plotkin and P. M. Vaidya , Sublinear-time parallel algorithms for matching and related problems ,Proc. of the 29th Annual IEEE Symp. on Foundations of Computer Science, IEEE, New York , 1988 , 174 \u2013 185 .","DOI":"10.1109\/SFCS.1988.21935"},{"key":"CIT0023","doi-asserted-by":"crossref","first-page":"1073","DOI":"10.1145\/322344.322353","volume":"29","author":"Goldschlager L. M.","year":"1982","journal-title":"Journal of the Association for Computing Machinery"},{"key":"CIT0024","doi-asserted-by":"crossref","DOI":"10.21236\/AD0705364","volume-title":"Graph Theory","author":"Harary F.","year":"1969"},{"key":"CIT0025","doi-asserted-by":"publisher","DOI":"10.1007\/BF02579407"},{"key":"CIT0026","doi-asserted-by":"publisher","DOI":"10.1007\/BF01840376"},{"key":"CIT0027","doi-asserted-by":"publisher","DOI":"10.1016\/0304-3975(90)90192-K"},{"key":"CIT0028","volume-title":"Combinatorial Optimization Networks and Matroids","author":"Lawler E. L.","year":"1976"},{"key":"CIT0029","first-page":"345","author":"Mulmuley K.","year":"1987","journal-title":"Proc. of the 19th ACM Annual Symp. on Theory of Computing"},{"key":"CIT0030","first-page":"161","volume-title":"Parallel Architectures","author":"Osiakwan C. N. K.","year":"1990"},{"key":"CIT0031","doi-asserted-by":"publisher","DOI":"10.1016\/S0167-8191(05)80054-7"},{"key":"CIT0032","unstructured":"R. C. Paige and C. P. Kruskal , Parallel algorithms for the shortest path problems ,Proc. of the 1985 International Conference on Parallel Processing( 1985 ), 14 \u2013 20 ."},{"key":"CIT0033","doi-asserted-by":"crossref","unstructured":"N. Pippenger , Simultaneous resource bounds (Preliminary Version) ,Proc. of the 20th IEEE Symp-on Foundations of Computer Science, IEEE Computer Society , Los Angeles ( 1979 ), 307 \u2013 311 .","DOI":"10.1109\/SFCS.1979.29"},{"key":"CIT0034","doi-asserted-by":"publisher","DOI":"10.1109\/TC.1986.1676783"}],"container-title":["Parallel Algorithms and Applications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/www.tandfonline.com\/doi\/pdf\/10.1080\/10637199508915506","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,5,12]],"date-time":"2023-05-12T22:54:43Z","timestamp":1683932083000},"score":1,"resource":{"primary":{"URL":"http:\/\/www.tandfonline.com\/doi\/abs\/10.1080\/10637199508915506"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1995,1]]},"references-count":34,"journal-issue":{"issue":"2-3","published-print":{"date-parts":[[1995,1]]}},"alternative-id":["10.1080\/10637199508915506"],"URL":"https:\/\/doi.org\/10.1080\/10637199508915506","relation":{},"ISSN":["1063-7192"],"issn-type":[{"value":"1063-7192","type":"print"}],"subject":[],"published":{"date-parts":[[1995,1]]}}}