乐胖代购免代理版

{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,4,20]],"date-time":"2024-04-20T09:08:09Z","timestamp":1713604089221},"reference-count":17,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[1988,3,1]],"date-time":"1988-03-01T00:00:00Z","timestamp":573177600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Combinatorica"],"published-print":{"date-parts":[[1988,3]]},"DOI":"10.1007\/bf02122548","type":"journal-article","created":{"date-parts":[[2005,10,29]],"date-time":"2005-10-29T06:29:39Z","timestamp":1130567379000},"page":"1-12","source":"Crossref","is-referenced-by-count":38,"title":["A random 1-011-011-01algorithm for depth first search"],"prefix":"10.1007","volume":"8","author":[{"given":"A.","family":"Aggarwal","sequence":"first","affiliation":[]},{"given":"R. J.","family":"Anderson","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"BF02122548_CR1","doi-asserted-by":"crossref","first-page":"315","DOI":"10.1007\/BF02579320","volume":"7","author":"R. J. Anderson","year":"1987","unstructured":"R. J. Anderson, A parallel algorithm for the maximal path problem,Combinatorica,7 (1987), 315\u2013326.","journal-title":"Combinatorica"},{"key":"BF02122548_CR2","unstructured":"R. J.Anderson, A parallel algorithm for depth-first search,Extended Abstract, Math. Science Research Institute (1986)."},{"key":"BF02122548_CR3","unstructured":"R. J.Anderson and E.Mayr, Parallelism and greedy algorithms,Technical Report No. STAN-CS-84-1003,Computer Science Department, Stanford University (1984)."},{"key":"BF02122548_CR4","doi-asserted-by":"crossref","first-page":"2","DOI":"10.1016\/S0019-9958(85)80041-3","volume":"64","author":"S. A. Cook","year":"1985","unstructured":"S. A. Cook, A taxonomy of problems with fast parallel algorithms,Information and Control,64 (1985), 2\u201322.","journal-title":"Information and Control"},{"key":"BF02122548_CR5","unstructured":"D.Eckstein and D.Alton, Parallel graph processing using depth first search,Proc. of the Conf. on Theoretical Computer Science at the Univ. of Waterloo, (1977), 21\u201329."},{"key":"BF02122548_CR6","doi-asserted-by":"crossref","first-page":"507","DOI":"10.1137\/0204043","volume":"4","author":"S. Even","year":"1975","unstructured":"S. Even andR. E. Tarjan, Network flow and testing graph connectivity,SIAM Journal of Computing,4 (1975), 507\u2013518.","journal-title":"SIAM Journal of Computing"},{"key":"BF02122548_CR7","doi-asserted-by":"crossref","first-page":"134","DOI":"10.1007\/BF01937481","volume":"24","author":"R. K. Ghosh","year":"1984","unstructured":"R. K. Ghosh andG. P. Bhattacharjee, A parallel search algorithm for directed acyclic graphs,BIT,24 (1984), 134\u2013150.","journal-title":"BIT"},{"key":"BF02122548_CR8","doi-asserted-by":"crossref","first-page":"35","DOI":"10.1007\/BF02579407","volume":"6","author":"R. M. Karp","year":"1986","unstructured":"R. M. Karp, E. Upfal andA. Wigderson, Constructing a maximum matching is in randomNC, Combinatorica,6 (1986), 35\u201348.","journal-title":"Combinatorica"},{"key":"BF02122548_CR9","doi-asserted-by":"crossref","first-page":"762","DOI":"10.1145\/4221.4226","volume":"32","author":"R. M. Karp","year":"1985","unstructured":"R. M. Karp andA. Wigderson, A fast parallel algorithm for the maximal independent set problem,Journal of ACM,32 (1985), 762\u2013773.","journal-title":"Journal of ACM"},{"key":"BF02122548_CR10","doi-asserted-by":"crossref","first-page":"177","DOI":"10.1137\/0136016","volume":"36","author":"R. J. Lipton","year":"1979","unstructured":"R. J. Lipton andR. E. Tarjan, A separator theorem for planar graphs,SIAM Journal of Applied Math. 36 (1979), 177\u2013189.","journal-title":"SIAM Journal of Applied Math."},{"key":"BF02122548_CR11","doi-asserted-by":"crossref","first-page":"105","DOI":"10.1007\/BF02579206","volume":"7","author":"K. Mulmuley","year":"1986","unstructured":"K. Mulmuley, U. V. Vazirani andV. V. Vazirani, Matching is as easy as matrix inversion,Combinatorica 7 (1986), 105\u2013114.","journal-title":"Combinatorica"},{"key":"BF02122548_CR12","unstructured":"V.Ramachandran,Personal Communication."},{"key":"BF02122548_CR13","doi-asserted-by":"crossref","first-page":"230","DOI":"10.1137\/0207020","volume":"7","author":"E. Reghbati","year":"1978","unstructured":"E. Reghbati andD. Corneil, Parallel computations in graph theory,SIAM Journal of Computing,7 (1978), 230\u2013237.","journal-title":"SIAM Journal of Computing"},{"key":"BF02122548_CR14","doi-asserted-by":"crossref","first-page":"229","DOI":"10.1016\/0020-0190(85)90024-9","volume":"20","author":"J. H. Reif","year":"1985","unstructured":"J. H. Reif, Depth-first search is inherently sequential,Information Processing Letters,20 (1985), 229\u2013234.","journal-title":"Information Processing Letters"},{"key":"BF02122548_CR15","doi-asserted-by":"crossref","first-page":"814","DOI":"10.1137\/0215058","volume":"15","author":"J. R. Smith","year":"1986","unstructured":"J. R. Smith, Parallel algorithms for depth first searches,SIAM Journal of Computing,15 (1986), 814\u2013830.","journal-title":"SIAM Journal of Computing"},{"key":"BF02122548_CR16","doi-asserted-by":"crossref","first-page":"146","DOI":"10.1137\/0201010","volume":"1","author":"R. E. Tarjan","year":"1972","unstructured":"R. E. Tarjan, Depth-first search and linear graph algorithms,SIAM J. of Computing,1 (1972), 146\u2013160.","journal-title":"SIAM J. of Computing"},{"key":"BF02122548_CR17","unstructured":"J. C.Wyllie,The Complexity of Parallel Computations, Phd. Thesis, Department of Computer Science, Cornell University, 1979."}],"container-title":["Combinatorica"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF02122548.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF02122548\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF02122548","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,14]],"date-time":"2019-05-14T01:22:27Z","timestamp":1557796947000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF02122548"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1988,3]]},"references-count":17,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1988,3]]}},"alternative-id":["BF02122548"],"URL":"https:\/\/doi.org\/10.1007\/bf02122548","relation":{},"ISSN":["0209-9683","1439-6912"],"issn-type":[{"value":"0209-9683","type":"print"},{"value":"1439-6912","type":"electronic"}],"subject":[],"published":{"date-parts":[[1988,3]]}}}