{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,1,11]],"date-time":"2023-01-11T05:39:10Z","timestamp":1673415550206},"reference-count":14,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[1998,1,1]],"date-time":"1998-01-01T00:00:00Z","timestamp":883612800000},"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":["Information Processing Letters"],"published-print":{"date-parts":[[1998,1]]},"DOI":"10.1016\/s0020-0190(97)00196-8","type":"journal-article","created":{"date-parts":[[2003,4,7]],"date-time":"2003-04-07T17:32:24Z","timestamp":1049736744000},"page":"107-109","source":"Crossref","is-referenced-by-count":2,"title":["A note on parallel complexity of maximum f-matching"],"prefix":"10.1016","volume":"65","author":[{"given":"Anders","family":"Dessmark","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Oscar","family":"Garrido","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Andrzej","family":"Lingas","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0020-0190(97)00196-8_BIB1","doi-asserted-by":"crossref","unstructured":"S.R. Arikati, A. Maheshwari, Realizing degree sequences in parallel, in: Proc. 5th ISAAC'94, Lecture Notes in Computer Science, vol. 834, Springer, Berlin, pp. 261\u2013269; to appear in: SIAM J. Discrete Math.","DOI":"10.1007\/3-540-58325-4_189"},{"key":"10.1016\/S0020-0190(97)00196-8_BIB2","doi-asserted-by":"crossref","unstructured":"T. Asano, Graphical degree sequence problems with connectivity requirements, in: Proc. ISAAC'93, Hong Kong, Lecture Notes in Computer Science, vol. 762, Springer, Berlin, pp. 88\u201397.","DOI":"10.1007\/3-540-57568-5_233"},{"key":"10.1016\/S0020-0190(97)00196-8_BIB3","series-title":"Graphs and Hypergraphs","author":"Berge","year":"1973"},{"key":"10.1016\/S0020-0190(97)00196-8_BIB4","doi-asserted-by":"crossref","first-page":"770","DOI":"10.1137\/0217049","article-title":"Parallel merge sort","volume":"17","author":"Cole","year":"1988","journal-title":"SIAM J. Comput."},{"key":"10.1016\/S0020-0190(97)00196-8_BIB5","series-title":"Proc. MFCS'94","first-page":"316","article-title":"On the parallel complexity of maximum f-matching and the degree sequence problem","volume":"vol. 841","author":"Dessmark","year":"1994"},{"issue":"2","key":"10.1016\/S0020-0190(97)00196-8_BIB6","doi-asserted-by":"crossref","first-page":"179","DOI":"10.1142\/S0129054193000122","article-title":"Parallel algorithms for finding maximal k-dependent sets and maximal f-matchings","volume":"4","author":"Diks","year":"1994","journal-title":"Internat. J. Foundations Comput. Sci."},{"key":"10.1016\/S0020-0190(97)00196-8_BIB7","doi-asserted-by":"crossref","first-page":"189","DOI":"10.1007\/BF02122800","article-title":"Improved processor bounds for combinatorial problems in RNC","volume":"8","author":"Galil","year":"1988","journal-title":"Combinatorica"},{"issue":"4","key":"10.1016\/S0020-0190(97)00196-8_BIB8","doi-asserted-by":"crossref","first-page":"387","DOI":"10.1007\/BF02579264","article-title":"A Las Vegas RNC algorithm for maximum matching","volume":"6","author":"Karloff","year":"1986","journal-title":"Combinatorica"},{"key":"10.1016\/S0020-0190(97)00196-8_BIB9","first-page":"869","article-title":"Parallel algorithms for shared memory machines","volume":"Vol. A","author":"Karp","year":"1990"},{"issue":"1","key":"10.1016\/S0020-0190(97)00196-8_BIB10","doi-asserted-by":"crossref","first-page":"35","DOI":"10.1007\/BF02579407","article-title":"Constructing a maximum matching is in Random NC","volume":"6","author":"Karp","year":"1986","journal-title":"Combinatorica"},{"key":"10.1016\/S0020-0190(97)00196-8_BIB11","series-title":"Proc. 21st FOCS","first-page":"17","article-title":"An O(\u221a\u00a6V\u2225E\u00a6) algorithm for finding maximum matching in general graphs","author":"Micali","year":"1980"},{"key":"10.1016\/S0020-0190(97)00196-8_BIB12","doi-asserted-by":"crossref","unstructured":"K. Mulmuley, U.V. Vazirani, V.V. Vazirani, Matching is as easy as matrix inversion, Combinatorica 7 (1), 105\u2013113.","DOI":"10.1007\/BF02579206"},{"key":"10.1016\/S0020-0190(97)00196-8_BIB13","series-title":"Mathematical Programming: The State of the Art","author":"Schrijver","year":"1982"},{"key":"10.1016\/S0020-0190(97)00196-8_BIB14","doi-asserted-by":"crossref","first-page":"347","DOI":"10.4153\/CJM-1954-033-3","article-title":"A short proof of the factor theorem for finite graphs","volume":"6","author":"Tutte","year":"1954","journal-title":"Canad. J. Math."}],"container-title":["Information Processing Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0020019097001968?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0020019097001968?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,22]],"date-time":"2019-04-22T18:53:42Z","timestamp":1555959222000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0020019097001968"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1998,1]]},"references-count":14,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1998,1]]}},"alternative-id":["S0020019097001968"],"URL":"https:\/\/doi.org\/10.1016\/s0020-0190(97)00196-8","relation":{},"ISSN":["0020-0190"],"issn-type":[{"value":"0020-0190","type":"print"}],"subject":[],"published":{"date-parts":[[1998,1]]}}}