{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,5]],"date-time":"2022-04-05T03:06:40Z","timestamp":1649128000865},"reference-count":34,"publisher":"Elsevier BV","issue":"2-3","license":[{"start":{"date-parts":[[1988,11,1]],"date-time":"1988-11-01T00:00:00Z","timestamp":594345600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":9024,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Theoretical Computer Science"],"published-print":{"date-parts":[[1988,11]]},"DOI":"10.1016\/0304-3975(88)90120-x","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T23:48:55Z","timestamp":1027640935000},"page":"121-136","source":"Crossref","is-referenced-by-count":4,"title":["Parallel construction of perfect matchings and Hamiltonian cycles on dense graphs"],"prefix":"10.1016","volume":"61","author":[{"given":"Elias","family":"Dahlhaus","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Marek","family":"Karpinski","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0304-3975(88)90120-X_BIB1","series-title":"Graphentheorie","author":"Aigner","year":"1983"},{"key":"10.1016\/0304-3975(88)90120-X_BIB2","first-page":"30","article-title":"Fast probabilistic algorithms for Hamiltonian circuits and matchings","author":"Angluin","year":"1977","journal-title":"Proc. 9th ACM STOC"},{"key":"10.1016\/0304-3975(88)90120-X_BIB3","series-title":"External Graph Theory","author":"Bollobas","year":"1978"},{"key":"10.1016\/0304-3975(88)90120-X_BIB4","first-page":"50","article-title":"How hard is it to marry at random","author":"Broder","year":"1986","journal-title":"Proc. 18th ACM STOC"},{"key":"10.1016\/0304-3975(88)90120-X_BIB5","doi-asserted-by":"crossref","first-page":"2","DOI":"10.1016\/S0019-9958(85)80041-3","article-title":"A taxonomy of problems with fast parallel algorithms","volume":"64","author":"Cook","year":"1985","journal-title":"Inform. and Control"},{"key":"10.1016\/0304-3975(88)90120-X_BIB6","doi-asserted-by":"crossref","first-page":"69","DOI":"10.1112\/plms\/s3-2.1.69","article-title":"Some theorems on abstract graphs","volume":"2","author":"Dirac","year":"1952","journal-title":"Proc. London Math. Soc. Ser. 3"},{"key":"10.1016\/0304-3975(88)90120-X_BIB7","series-title":"Research Report No. 855-CS","article-title":"The matching problem for strongly chordal graphs is in NC","author":"Dahlhaus","year":"1986"},{"key":"10.1016\/0304-3975(88)90120-X_BIB8","doi-asserted-by":"crossref","unstructured":"E. Dahlhaus and M. Karpinski, Perfect matching for regular graphs is AC0-hard for the general matching problem, J. Comput. System Sci., to appear.","DOI":"10.1016\/0022-0000(92)90005-4"},{"key":"10.1016\/0304-3975(88)90120-X_BIB9","doi-asserted-by":"crossref","first-page":"337","DOI":"10.1016\/0304-3975(86)90184-2","article-title":"The complexity of colouring graphs problems on dense graphs","volume":"43","author":"Edwards","year":"1986","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0304-3975(88)90120-X_BIB10","doi-asserted-by":"crossref","first-page":"111","DOI":"10.1016\/0020-0190(87)90229-8","article-title":"Parallel algorithms for finding Hamiltonian cycles in random graphs","volume":"25","author":"Frieze","year":"1987","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/0304-3975(88)90120-X_BIB11","series-title":"Algorithmic Graph Theory","author":"Gibbons","year":"1985"},{"key":"10.1016\/0304-3975(88)90120-X_BIB12","series-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"Garey","year":"1979"},{"key":"10.1016\/0304-3975(88)90120-X_BIB13","first-page":"166","article-title":"The matching problem for bipartite graphs with polynomially bounded permanents is in NC","author":"Grigoriev","year":"1987","journal-title":"Proc. 28th IEEE FOCS"},{"key":"10.1016\/0304-3975(88)90120-X_BIB14","doi-asserted-by":"crossref","first-page":"1073","DOI":"10.1145\/322344.322353","article-title":"Synchroneous parallel computation","volume":"29","author":"Goldschlager","year":"1982","journal-title":"J. ACM"},{"key":"10.1016\/0304-3975(88)90120-X_BIB15","first-page":"161","article-title":"A new parallel algorithm for the maximal independent set problem","author":"Goldberg","year":"1987","journal-title":"Proc. 28th IEEE FOCS"},{"key":"10.1016\/0304-3975(88)90120-X_BIB16","series-title":"Tech. Rept. CS 88-003","article-title":"Fast parallel algorithm for finding a Hamiltonian cycle in dense graphs","author":"Hajnal","year":"1988"},{"key":"10.1016\/0304-3975(88)90120-X_BIB17","series-title":"VLSI-Algorithms and Architectures","first-page":"12","article-title":"Two-processor scheduling is in NC","volume":"227","author":"Hembold","year":"1986"},{"key":"10.1016\/0304-3975(88)90120-X_BIB18","first-page":"22","article-title":"Constructing a perfect matching is in random NC","author":"Karp","year":"1985","journal-title":"Proc. 17th ACM STOC"},{"key":"10.1016\/0304-3975(88)90120-X_BIB19","first-page":"464","article-title":"Are search and decision problems computationally equivalent","author":"Karp","year":"1985","journal-title":"Proc. 17th ACM STOC"},{"key":"10.1016\/0304-3975(88)90120-X_BIB20","first-page":"266","article-title":"A fast parallel algorithm for the maximal independent set problem","author":"Karp","year":"1984","journal-title":"Proc. 15th ACM STOC"},{"key":"10.1016\/0304-3975(88)90120-X_BIB21","unstructured":"M. Karpinski and A. Lingas, Subtree isomorphisms and bipartite matchings are mutually NC-reducible Inform. Process. Lett., to appear."},{"key":"10.1016\/0304-3975(88)90120-X_BIB22","series-title":"Proc. 5th Conf. on Foundations of Software, Technical and Computer Science","first-page":"496","article-title":"NC-algorithms for comparability graphs, interval graphs, and testing for unique perfect matching","volume":"206","author":"Kozen","year":"1985"},{"key":"10.1016\/0304-3975(88)90120-X_BIB23","year":"1985"},{"key":"10.1016\/0304-3975(88)90120-X_BIB24","doi-asserted-by":"crossref","first-page":"93","DOI":"10.1109\/TC.1981.6312171","article-title":"A fast parallel algorithm for routing in permutation networks","volume":"C-30","author":"Lev","year":"1981","journal-title":"IEEE-Trans. Comput."},{"key":"10.1016\/0304-3975(88)90120-X_BIB25","article-title":"Matching Theory","volume":"25","author":"Lov\u00e1sz","year":"1986"},{"key":"10.1016\/0304-3975(88)90120-X_BIB26","first-page":"1","article-title":"A simple parallel algorithm for the maximal independent set problem","author":"Luby","year":"1985","journal-title":"Proc. 17th ACM STOC"},{"key":"10.1016\/0304-3975(88)90120-X_BIB27","first-page":"345","article-title":"Matching is as easy as matrix inversion","author":"Mulmuley","year":"1987","journal-title":"Proc. 19th ACM STOC"},{"key":"10.1016\/0304-3975(88)90120-X_BIB28","series-title":"Combinatoric Optimization: Algorithms and Complexity","author":"Papadimitriou","year":"1982"},{"key":"10.1016\/0304-3975(88)90120-X_BIB29","first-page":"418","article-title":"The token distribution problem","author":"Peleg","year":"1986","journal-title":"Proc. 2nd IEEE FOCS"},{"key":"10.1016\/0304-3975(88)90120-X_BIB30","first-page":"264","article-title":"Constructing disjoint paths on expander graphs","author":"Peleg","year":"1987","journal-title":"Proc. 19th ACM STOC"},{"key":"10.1016\/0304-3975(88)90120-X_BIB31","doi-asserted-by":"crossref","first-page":"218","DOI":"10.1016\/0022-0000(80)90036-7","article-title":"Tree size bounded alternation","volume":"21","author":"Ruzzo","year":"1980","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/0304-3975(88)90120-X_BIB32","series-title":"Report No. UCB\/CSD 87\/309","article-title":"Fast parallel algorithms for finding Hamiltonian paths and cycles in a tournament","author":"Soroker","year":"1986"},{"key":"10.1016\/0304-3975(88)90120-X_BIB33","author":"Shamir","year":"1986","journal-title":"Parallel routing in networks: Back to circuit switching?"},{"key":"10.1016\/0304-3975(88)90120-X_BIB34","doi-asserted-by":"crossref","first-page":"57","DOI":"10.1016\/0196-6774(82)90008-6","article-title":"An O(log n) parallel connectivity algorithm","volume":"3","author":"Shiloach","year":"1982","journal-title":"J. Algorithms"}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:030439758890120X?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:030439758890120X?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,12]],"date-time":"2019-04-12T23:54:50Z","timestamp":1555113290000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/030439758890120X"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1988,11]]},"references-count":34,"journal-issue":{"issue":"2-3","published-print":{"date-parts":[[1988,11]]}},"alternative-id":["030439758890120X"],"URL":"https:\/\/doi.org\/10.1016\/0304-3975(88)90120-x","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[1988,11]]}}}