{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,31]],"date-time":"2022-03-31T17:35:25Z","timestamp":1648748125882},"reference-count":10,"publisher":"Elsevier BV","issue":"9","license":[{"start":{"date-parts":[[1993,9,1]],"date-time":"1993-09-01T00:00:00Z","timestamp":746841600000},"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":["Parallel Computing"],"published-print":{"date-parts":[[1993,9]]},"DOI":"10.1016\/0167-8191(93)90089-4","type":"journal-article","created":{"date-parts":[[2003,9,3]],"date-time":"2003-09-03T13:52:02Z","timestamp":1062597122000},"page":"961-971","source":"Crossref","is-referenced-by-count":1,"title":["Parallel algorithms for finding a suboptimal fundamental-cycle set in a graph"],"prefix":"10.1016","volume":"19","author":[{"given":"Zbigniew J.","family":"Czech","sequence":"first","affiliation":[]},{"given":"Marek","family":"Konopka","sequence":"additional","affiliation":[]},{"given":"Bohdan S.","family":"Majewski","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0167-8191(93)90089-4_BIB1","doi-asserted-by":"crossref","first-page":"257","DOI":"10.1016\/0020-0190(92)90220-P","article-title":"An optimal algorithm for generating minimal perfect hash functions","volume":"43","author":"Czech","year":"1992","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/0167-8191(93)90089-4_BIB2_1","first-page":"1","article-title":"Generating a minimal perfect hash function in O(M2) time","volume":"Tom 4","author":"Czech","year":"1992","journal-title":"Archiwum Informatyki Teoretycznej i Stosowanej"},{"key":"10.1016\/0167-8191(93)90089-4_BIB2_2","first-page":"3","article-title":"Generating a minimal perfect hash function in O(M2) time","volume":"Tom 4","author":"Czech","year":"1992","journal-title":"Archiwum Informatyki Teoretycznej i Stosowanej"},{"key":"10.1016\/0167-8191(93)90089-4_BIB3","doi-asserted-by":"crossref","first-page":"143","DOI":"10.1016\/0167-8191(90)90143-W","article-title":"Parallel graph algorithms for hypercube computers","volume":"13","author":"Das","year":"1990","journal-title":"Parallel Comput"},{"key":"10.1016\/0167-8191(93)90089-4_BIB4","doi-asserted-by":"crossref","first-page":"527","DOI":"10.1016\/S0167-8191(05)80155-3","article-title":"Performance of parallel spanning tree algorithms on linear arrays of transputers and Unix systems","volume":"17","author":"Das","year":"1991","journal-title":"Parallel Comput."},{"issue":"1","key":"10.1016\/0167-8191(93)90089-4_BIB5","doi-asserted-by":"crossref","first-page":"26","DOI":"10.1145\/355984.355988","article-title":"Algorithms for generating fundamental cycles in a graph","volume":"8","author":"Deo","year":"1982","journal-title":"ACM Trans. Math. Soft."},{"key":"10.1016\/0167-8191(93)90089-4_BIB6","first-page":"219","article-title":"An algorithm for generation the minimum length fundamental cycle set in a graph","volume":"50","author":"Egyhazy","year":"1985","journal-title":"Congr. Numer."},{"key":"10.1016\/0167-8191(93)90089-4_BIB7","series-title":"Recent Advances in Graph Theory, Proc. Symp.","first-page":"283","article-title":"Minimal bases of cycles of a graph","author":"Hubicka","year":"1974"},{"key":"10.1016\/0167-8191(93)90089-4_BIB8","article-title":"A family of generators of minimal perfect hash functions","author":"Majewski","year":"1992"},{"key":"10.1016\/0167-8191(93)90089-4_BIB9","doi-asserted-by":"crossref","first-page":"67","DOI":"10.1016\/0020-0255(86)90013-7","article-title":"Finding fundamental cycles and bridges on a tree-structured parallel computer","volume":"40","author":"Yeh","year":"1986","journal-title":"Inform. Sci."}],"container-title":["Parallel Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0167819193900894?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0167819193900894?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,2,25]],"date-time":"2019-02-25T04:28:06Z","timestamp":1551068886000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0167819193900894"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1993,9]]},"references-count":10,"journal-issue":{"issue":"9","published-print":{"date-parts":[[1993,9]]}},"alternative-id":["0167819193900894"],"URL":"https:\/\/doi.org\/10.1016\/0167-8191(93)90089-4","relation":{},"ISSN":["0167-8191"],"issn-type":[{"value":"0167-8191","type":"print"}],"subject":[],"published":{"date-parts":[[1993,9]]}}}