{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,22]],"date-time":"2026-04-22T08:29:01Z","timestamp":1776846541203,"version":"3.51.2"},"reference-count":5,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[1988,6,1]],"date-time":"1988-06-01T00:00:00Z","timestamp":581126400000},"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":[[1988,6]]},"DOI":"10.1016\/0020-0190(88)90164-0","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T00:11:21Z","timestamp":1027642281000},"page":"61-65","source":"Crossref","is-referenced-by-count":58,"title":["An improved parallel algorithm that computes the BFS numbering of a directed graph"],"prefix":"10.1016","volume":"28","author":[{"given":"Hillel","family":"Gazit","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Gary L.","family":"Miller","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0020-0190(88)90164-0_BIB1","series-title":"The Design and Analysis of Computer Algorithms","author":"Aho","year":"1974"},{"key":"10.1016\/0020-0190(88)90164-0_BIB2","series-title":"Computer Algorithms: Introduction to Design and Analysis","author":"Baase","year":"1983"},{"key":"10.1016\/0020-0190(88)90164-0_BIB3","first-page":"1","article-title":"Matrix multiplication via arithmetic progressions","author":"Coppersmith","year":"1987","journal-title":"Proc. 19th Ann. ACM Symp. on Theory of Computing"},{"key":"10.1016\/0020-0190(88)90164-0_BIB4","series-title":"How to Multiply Matrices Faster","author":"Pan","year":"1984"},{"key":"10.1016\/0020-0190(88)90164-0_BIB5","doi-asserted-by":"crossref","first-page":"354","DOI":"10.1007\/BF02165411","article-title":"Gaussian elimination is not optimal","volume":"13","author":"Strassen","year":"1969","journal-title":"Numerische Mathematik"}],"container-title":["Information Processing Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0020019088901640?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0020019088901640?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,12]],"date-time":"2019-04-12T13:21:19Z","timestamp":1555075279000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0020019088901640"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1988,6]]},"references-count":5,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1988,6]]}},"alternative-id":["0020019088901640"],"URL":"https:\/\/doi.org\/10.1016\/0020-0190(88)90164-0","relation":{},"ISSN":["0020-0190"],"issn-type":[{"value":"0020-0190","type":"print"}],"subject":[],"published":{"date-parts":[[1988,6]]}}}