{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,11]],"date-time":"2022-04-11T14:47:36Z","timestamp":1649688456001},"reference-count":10,"publisher":"Informa UK Limited","issue":"2","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Parallel Algorithms and Applications"],"published-print":{"date-parts":[[1998,8]]},"DOI":"10.1080\/01495739808947365","type":"journal-article","created":{"date-parts":[[2007,7,7]],"date-time":"2007-07-07T02:52:59Z","timestamp":1183776779000},"page":"153-165","source":"Crossref","is-referenced-by-count":4,"title":["PARALLEL INCREMENTAL ALGORITHMS FOR ANALYZING ACTIVITY NETWORKS"],"prefix":"10.1080","volume":"13","author":[{"given":"PRANAY","family":"CHAUDHURI","sequence":"first","affiliation":[{"name":"a   Department of Electrical and Computer Engineering , Kuwait University , PO Box 5969, Safat,  Kuwait"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"301","published-online":{"date-parts":[[2007,4,27]]},"reference":[{"key":"CIT0001","doi-asserted-by":"crossref","first-page":"111","DOI":"10.1080\/10637199608915567","volume":"9","author":"Chaudhuri P.","year":"1996","journal-title":"Parallel Algorithnms and Applications"},{"key":"CIT0002","doi-asserted-by":"crossref","first-page":"247","DOI":"10.1093\/comjnl\/33.3.247","volume":"33","author":"Chaudhuri P.","year":"1990","journal-title":"Computer Journal"},{"key":"CIT0003","volume-title":"Parallel Algorithms Design ami Analysis","author":"Chaudhuri P.","year":"1992"},{"key":"CIT0004","doi-asserted-by":"publisher","DOI":"10.1007\/BF01935049"},{"key":"CIT0005","unstructured":"G.   Cheston    ,   Incremental algorithms in graph theory  ,     Tech. Rep. TR\u201391  ,   Dept. of Computer Science, University of Toronto  ,  Ontario  (  1976  ) ."},{"key":"CIT0006","doi-asserted-by":"crossref","first-page":"333","DOI":"10.1016\/0022-0000(78)90022-3","volume":"16","author":"Chin F.Y.","year":"1978","journal-title":"J. Computer and System Sci."},{"key":"CIT0007","doi-asserted-by":"crossref","first-page":"227","DOI":"10.1016\/0020-0190(88)90084-1","volume":"27","author":"Jung H.","year":"1988","journal-title":"Inform, Process. Leu."},{"key":"CIT0008","doi-asserted-by":"crossref","first-page":"223","DOI":"10.1016\/0020-0190(86)90098-0","volume":"21","author":"Pawagi S.","year":"1986","journal-title":"Inform. Process. Lett."},{"key":"CIT0009","doi-asserted-by":"crossref","first-page":"88","DOI":"10.1016\/0196-6774(81)90010-9","volume":"2","author":"Shiloach Y.","year":"1982","journal-title":"J. Algorithms"},{"key":"CIT0010","doi-asserted-by":"crossref","first-page":"375","DOI":"10.1137\/0204032","volume":"4","author":"Spira P.M.","year":"1975","journal-title":"SIAM J. Computing"}],"container-title":["Parallel Algorithms and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.tandfonline.com\/doi\/pdf\/10.1080\/01495739808947365","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2018,6,29]],"date-time":"2018-06-29T10:47:44Z","timestamp":1530269264000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.tandfonline.com\/doi\/full\/10.1080\/01495739808947365"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1998,8]]},"references-count":10,"journal-issue":{"issue":"2","published-online":{"date-parts":[[2007,4,27]]},"published-print":{"date-parts":[[1998,8]]}},"alternative-id":["10.1080\/01495739808947365"],"URL":"https:\/\/doi.org\/10.1080\/01495739808947365","relation":{},"ISSN":["1063-7192"],"issn-type":[{"value":"1063-7192","type":"print"}],"subject":[],"published":{"date-parts":[[1998,8]]}}}