{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,30]],"date-time":"2025-05-30T04:08:01Z","timestamp":1748578081213,"version":"3.41.0"},"publisher-location":"Cham","reference-count":13,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319219080"},{"type":"electronic","value":"9783319219097"}],"license":[{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2015]]},"DOI":"10.1007\/978-3-319-21909-7_19","type":"book-chapter","created":{"date-parts":[[2015,7,24]],"date-time":"2015-07-24T06:16:04Z","timestamp":1437718564000},"page":"201-209","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Constructions Used in Associative Parallel Algorithms for Directed Graphs"],"prefix":"10.1007","author":[{"given":"Anna","family":"Nepomniaschaya","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2015,7,25]]},"reference":[{"key":"19_CR1","doi-asserted-by":"publisher","first-page":"269","DOI":"10.1007\/BF01386390","volume":"1","author":"EW Dijkstra","year":"1959","unstructured":"Dijkstra, E.W.: A note on two problems in connection with graphs. J. Numerische Mathematik. 1, 269\u2013271 (1959)","journal-title":"J. Numerische Mathematik."},{"issue":"2\u20133","key":"19_CR2","doi-asserted-by":"publisher","first-page":"273","DOI":"10.1016\/0304-3975(86)90098-8","volume":"48","author":"GF Italiano","year":"1986","unstructured":"Italiano, G.F.: Amortized efficiency of a path retrieval data structure. J. Theoret. Comput. Sci. 48(2\u20133), 273\u2013281 (1986)","journal-title":"J. Theoret. Comput. Sci."},{"key":"19_CR3","doi-asserted-by":"publisher","first-page":"5","DOI":"10.1016\/0020-0190(88)90136-6","volume":"28","author":"GF Italiano","year":"1988","unstructured":"Italiano, G.F.: Finding paths and deleting edges in directed acyclic graphs. J. Inf. Process. Lett. 28, 5\u201311 (1988)","journal-title":"J. Inf. Process. Lett."},{"key":"19_CR4","doi-asserted-by":"crossref","first-page":"227","DOI":"10.3233\/FI-2000-43123412","volume":"43","author":"AS Nepomniaschaya","year":"2000","unstructured":"Nepomniaschaya, A.S., Dvoskina, M.A.: A simple implementation of Dijkstra\u2019s shortest path algorithm on associative parallel processors. J. Fundamenta Informaticae 43, 227\u2013243 (2000). IOS Press","journal-title":"J. Fundamenta Informaticae"},{"unstructured":"Nepomniaschaya, A.S.: Basic associative parallel algorithms for vertical processing systems. In: Bulletin of the Novosibirsk Computing Center, IIS Special Issue 29, pp. 63\u201377. NCC Publisher (2009)","key":"19_CR5"},{"doi-asserted-by":"crossref","unstructured":"Nepomniaschaya, A.S.: Constructions used in associative parallel algorithms for undirected graphs. Part 1. In: Bulletin of the Novosibirsk Computing Center, IIS Special Issue 35, pp. 67\u201381. NCC Publisher (2013)","key":"19_CR6","DOI":"10.31144\/bncc.cs.2542-1972.2013.n35.p69-83"},{"unstructured":"Nepomniaschaya, A.S.: Constructions used in associative parallel algorithms for undirected graphs. Part 2. In: Bulletin of the Novosibirsk Computing Center, Issue 36, pp. 65\u201378. NCC Publisher (2014)","key":"19_CR7"},{"unstructured":"Nepomniaschaya, A. S.: Concurrent selection of the shortest paths and distances in directed graphs using vertical processing systems. In: Bulletin of the Novosibirsk Computing Center, Issue 19, pp. 61\u201372. NCC Publisher (2003)","key":"19_CR8"},{"key":"19_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"442","DOI":"10.1007\/978-3-540-73940-1_44","volume-title":"Parallel Computing Technologies","author":"AS Nepomniaschaya","year":"2007","unstructured":"Nepomniaschaya, A.S.: Associative version of italiano\u2019s decremental algorithm for the transitive closure problem. In: Malyshkin, V.E. (ed.) PaCT 2007. LNCS, vol. 4671, pp. 442\u2013452. Springer, Heidelberg (2007)"},{"issue":"2\u20133","key":"19_CR10","doi-asserted-by":"crossref","first-page":"313","DOI":"10.3233\/FUN-2008-892-307","volume":"89","author":"AS Nepomniaschaya","year":"2008","unstructured":"Nepomniaschaya, A.S.: Efficient Implementation of the Italiano algorithms for updating the transitive closure on associative parallel processors. J. Fundamenta Informaticae. 89(2\u20133), 313\u2013329 (2008). IOS Press","journal-title":"J. Fundamenta Informaticae."},{"key":"19_CR11","first-page":"331","volume":"32","author":"AS Nepomniaschaya","year":"2013","unstructured":"Nepomniaschaya, A.S.: Efficient parallel implementation of the Ramalingam decremental algorithm for updating the shortest paths subgraph. J. Comput. Inform. 32, 331\u2013354 (2013)","journal-title":"J. Comput. Inform."},{"key":"19_CR12","first-page":"45","volume":"3","author":"AS Nepomniaschaya","year":"2012","unstructured":"Nepomniaschaya, A.S.: Associative version of the Ramalingam algorithm for the dynamic update of the shortest paths subgraph after inserting a new edge. J. Cybern. Syst. Anal. 3, 45\u201357 (2012). Kiev: Naukova Dumka (in Russian) (English translation by Springer)","journal-title":"J. Cybern. Syst. Anal."},{"key":"19_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","DOI":"10.1007\/BFb0028290","volume-title":"Bounded Incremental Computation","author":"G Ramalingam","year":"1996","unstructured":"Ramalingam, G.: Bounded Incremental Computation. LNCS, vol. 1089. Springer, Heidelberg (1996)"}],"container-title":["Lecture Notes in Computer Science","Parallel Computing Technologies"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-21909-7_19","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,29]],"date-time":"2025-05-29T16:59:16Z","timestamp":1748537956000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-21909-7_19"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783319219080","9783319219097"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-21909-7_19","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2015]]},"assertion":[{"value":"25 July 2015","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}