{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,3]],"date-time":"2022-04-03T20:40:42Z","timestamp":1649018442589},"reference-count":20,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[1993,1,1]],"date-time":"1993-01-01T00:00:00Z","timestamp":725846400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Algorithmica"],"published-print":{"date-parts":[[1993,1]]},"DOI":"10.1007\/bf01185336","type":"journal-article","created":{"date-parts":[[2005,2,18]],"date-time":"2005-02-18T16:45:05Z","timestamp":1108745105000},"page":"23-31","source":"Crossref","is-referenced-by-count":3,"title":["A parallel algorithm for approximating the minimum cycle cover"],"prefix":"10.1007","volume":"9","author":[{"given":"Philip","family":"Klein","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Clifford","family":"Stein","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"CR1","doi-asserted-by":"crossref","first-page":"345","DOI":"10.1137\/0606035","volume":"6","author":"N. Alon","year":"1985","unstructured":"N. Alon and M. Tarsi. Covering multigraphs by simple circuits.SIAM J. Algebraic Discrete Methods,6:345?350, 1985.","journal-title":"SIAM J. Algebraic Discrete Methods"},{"key":"CR2","doi-asserted-by":"crossref","unstructured":"B. Awerbach, A. Israeli, and Y. Shiloach. Finding Euler circuits in logarithmic parallel time. InProceedings of the 16th Annual ACM Symposium on Theory of Computing, 1984, pp. 249?257.","DOI":"10.1145\/800057.808688"},{"key":"CR3","volume-title":"Graphs and Hypergraphs","author":"C. Berge","year":"1979","unstructured":"C. Berge.Graphs and Hypergraphs. North-Holland, Amsterdam, 1979."},{"key":"CR4","doi-asserted-by":"crossref","unstructured":"R. Cole and U. Vishkin. Approximate and exact parallel scheduling with applications to list, tree, and graph problems. InProceedings of the 27th Annual Symposium on Foundations of Computer Science, 1986, pp. 478?491.","DOI":"10.1109\/SFCS.1986.10"},{"key":"CR5","volume-title":"Bulletin 286","author":"H. Cross","year":"1936","unstructured":"H. Cross. Analysis of flow in networks of conduits of conductors. Bulletin 286, University of Illinois Engineering Experimental Station, Urbana, Illinois, 1936."},{"key":"CR6","doi-asserted-by":"crossref","first-page":"345","DOI":"10.1007\/BF00998632","volume":"5","author":"H. Gabow","year":"1976","unstructured":"H. Gabow. Using Euler partitions to edge-color bipartite multigraphs.Internat. J. Comput. Inform. Sci.,5:345?355, 1976.","journal-title":"Internat. J. Comput. Inform. Sci."},{"issue":"4","key":"CR7","doi-asserted-by":"crossref","first-page":"746","DOI":"10.1137\/0210058","volume":"10","author":"A. Itai","year":"1981","unstructured":"A. Itai, R. J. Lipton, C. H. Papadimitriou, and M. Rodeh. Covering graphs by simple circuits.SIAM J. Comput.,10(4):746?750, 1981.","journal-title":"SIAM J. Comput."},{"key":"CR8","doi-asserted-by":"crossref","unstructured":"A. Itai and M. Rodeh. Covering a graph by circuits. InProceeding of the ICALP Conference, Udine, 1978.","DOI":"10.1007\/3-540-08860-1_21"},{"key":"CR9","unstructured":"F. Jaeger. On nowhere-zero flow in muitigraphs. InProceedings of the Fifth British Combinatorial Conference, 1975, pp. 373?378."},{"key":"CR10","volume-title":"An optimal parallel algorithm for computing connected components in a graph. Preprint","author":"H. Jung","year":"1989","unstructured":"H. Jung. An optimal parallel algorithm for computing connected components in a graph. Preprint, Humboldt University, Berlin, 1989."},{"key":"CR11","doi-asserted-by":"crossref","unstructured":"R. Karp, E. Upfal, and A. Wigderson. Constructing a perfect matching is in randomNC. InProceedings of the 17th Annual ACM Symposium on Theory of Computing, 1985, pp. 22?32.","DOI":"10.1145\/22145.22148"},{"issue":"6","key":"CR12","doi-asserted-by":"crossref","first-page":"307","DOI":"10.1016\/0020-0190(90)90015-P","volume":"34","author":"P. Klein","year":"1990","unstructured":"P. Klein and C. Stein. A parallel algorithm for eliminating cycles in undirected graphs.Inform. Process. Lett.,34(6):307?312, 1990.","journal-title":"Inform. Process. Lett."},{"key":"CR13","doi-asserted-by":"crossref","first-page":"93","DOI":"10.1109\/TC.1981.6312171","volume":"C-30","author":"G. F. Lev","year":"1981","unstructured":"G. F. Lev, N. Pippenger, and L. G. Valiant. A fast parallel algorithm for routing in permutation networks.IEEE Trans. Comput.,C-30:93?100, 1981.","journal-title":"IEEE Trans. Comput."},{"key":"CR14","doi-asserted-by":"crossref","unstructured":"L. Lov\u00e1sz. Computing ears and branchings in parallel. InProceedings of the 26th Annual Symposium on Foundations of Computer Science, 1985, pp. 464?467.","DOI":"10.1109\/SFCS.1985.16"},{"key":"CR15","series-title":"Lecture Notes in Computer Science 227","doi-asserted-by":"crossref","first-page":"34","DOI":"10.1007\/3-540-16766-8_4","volume-title":"VLSI Algorithms and Architectures","author":"Y. Maon","year":"1986","unstructured":"Y. Maon, B. Schieber, and U. Vishkin. Parallel ear decomposition search (EDS) andst-numbering in graphs. InVLSI Algorithms and Architectures, Lecture Notes in Computer Science 227, Springer-Verlag, Berlin, 1986, pp. 34?35."},{"key":"CR16","series-title":"Lecture Notes in Computer Science 319","doi-asserted-by":"crossref","first-page":"111","DOI":"10.1007\/BFb0040379","volume-title":"Aegean Workshop on Computing","author":"B. Schieber","year":"1988","unstructured":"B. Schieber and U. Vishkin. On finding lowest common ancestors: simplification and parallelization. InAegean Workshop on Computing, Lecture Notes in Computer Science 319, Springer-Verlag, Berlin, 1988, pp. 111?123."},{"key":"CR17","doi-asserted-by":"crossref","first-page":"130","DOI":"10.1016\/0095-8956(81)90058-7","volume":"30","author":"P. D. Seymour","year":"1981","unstructured":"P. D. Seymour. Nowhere-zero 6 flows.J. Combin. Theory Ser. B,30:130?135, 1981.","journal-title":"J. Combin. Theory Ser. B"},{"key":"CR18","doi-asserted-by":"crossref","first-page":"24","DOI":"10.1016\/0020-0190(79)90086-3","volume":"8","author":"Y. Shiloach","year":"1979","unstructured":"Y. Shiloach. Edge-disjoint branching in directed muitigraphs.Inform. Process. Lett.,8:24?27, 1979.","journal-title":"Inform. Process. Lett."},{"key":"CR19","doi-asserted-by":"crossref","first-page":"51","DOI":"10.1016\/0020-0190(74)90024-6","volume":"3","author":"R. E. Tarjan","year":"1975","unstructured":"R. E. Tarjan. A good algorithm for edge-disjoint branchings.Inform. Process. Lett.,3:51?53, 1975.","journal-title":"Inform. Process. Lett."},{"key":"CR20","doi-asserted-by":"crossref","unstructured":"R. E. Tarjan and U. Vishkin. Finding biconnected components and computing tree functions in logarithmic parallel time. InProceedings of the 16th Annual ACM Symposium on Theory of Computing, 1984, pp. 12?20.","DOI":"10.1109\/SFCS.1984.715896"}],"container-title":["Algorithmica"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01185336.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF01185336\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01185336","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,5]],"date-time":"2020-04-05T21:15:53Z","timestamp":1586121353000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF01185336"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1993,1]]},"references-count":20,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1993,1]]}},"alternative-id":["BF01185336"],"URL":"https:\/\/doi.org\/10.1007\/bf01185336","relation":{},"ISSN":["0178-4617","1432-0541"],"issn-type":[{"value":"0178-4617","type":"print"},{"value":"1432-0541","type":"electronic"}],"subject":[],"published":{"date-parts":[[1993,1]]}}}