{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,28]],"date-time":"2025-03-28T09:45:07Z","timestamp":1743155107970,"version":"3.40.3"},"publisher-location":"Cham","reference-count":10,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031156281"},{"type":"electronic","value":"9783031156298"}],"license":[{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2022]]},"DOI":"10.1007\/978-3-031-15629-8_24","type":"book-chapter","created":{"date-parts":[[2022,9,24]],"date-time":"2022-09-24T16:26:53Z","timestamp":1664036813000},"page":"467-471","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["A Note on\u00a0the\u00a0Message Complexity of\u00a0Cidon\u2019s Distributed Depth-First Search Algorithm"],"prefix":"10.1007","author":[{"given":"Saidgani","family":"Musaev","sequence":"first","affiliation":[]},{"given":"Wan","family":"Fokkink","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2022,9,7]]},"reference":[{"issue":"3","key":"24_CR1","doi-asserted-by":"publisher","first-page":"147","DOI":"10.1016\/0020-0190(85)90083-3","volume":"20","author":"B Awerbuch","year":"1985","unstructured":"Awerbuch, B.: A new distributed depth-first-search algorithm. Inf. Process. Lett. 20(3), 147\u2013150 (1985)","journal-title":"Inf. Process. Lett."},{"issue":"4","key":"24_CR2","doi-asserted-by":"publisher","first-page":"504","DOI":"10.1109\/TSE.1983.234958","volume":"9","author":"T-Y Cheung","year":"1983","unstructured":"Cheung, T.-Y.: Graph traversal techniques and the maximum flow problem in distributed computation. IEEE Trans. Softw. Eng. 9(4), 504\u2013512 (1983)","journal-title":"IEEE Trans. Softw. Eng."},{"issue":"6","key":"24_CR3","doi-asserted-by":"publisher","first-page":"301","DOI":"10.1016\/0020-0190(88)90187-1","volume":"26","author":"I Cidon","year":"1988","unstructured":"Cidon, I.: Yet another distributed depth-first search algorithm. Inf. Process. Lett. 26(6), 301\u2013305 (1988)","journal-title":"Inf. Process. Lett."},{"key":"24_CR4","volume-title":"Distributed Algorithms: An Intuitive Approach","author":"WJ Fokkink","year":"2018","unstructured":"Fokkink, W.J.: Distributed Algorithms: An Intuitive Approach, 2nd edn. MIT Press, Cambridge (2018)","edition":"2"},{"issue":"2","key":"24_CR5","doi-asserted-by":"publisher","first-page":"103","DOI":"10.1016\/0020-0190(87)90228-6","volume":"25","author":"KB Lakshmanan","year":"1987","unstructured":"Lakshmanan, K.B., Meenakshi, N., Thulasiraman, K.: A time-optimal message-efficient distributed algorithm for depth-first search. Inf. Process. Lett. 25(2), 103\u2013109 (1987)","journal-title":"Inf. Process. Lett."},{"issue":"1","key":"24_CR6","doi-asserted-by":"publisher","first-page":"7","DOI":"10.1016\/S0020-0190(96)00141-X","volume":"60","author":"SAM Makki","year":"1996","unstructured":"Makki, S.A.M., Havas, G.: Distributed algorithms for depth-first-search. Inf. Process. Lett. 60(1), 7\u201312 (1996)","journal-title":"Inf. Process. Lett."},{"issue":"4","key":"24_CR7","doi-asserted-by":"publisher","first-page":"183","DOI":"10.1016\/0020-0190(89)90041-0","volume":"32","author":"MB Sharma","year":"1989","unstructured":"Sharma, M.B., Iyengar, S.S.: An efficient distributed depth-first-search algorithm. Inf. Process. Lett. 32(4), 183\u2013186 (1989)","journal-title":"Inf. Process. Lett."},{"key":"24_CR8","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9781139168724","volume-title":"Introduction to Distributed Algorithms","author":"G Tel","year":"2000","unstructured":"Tel, G.: Introduction to Distributed Algorithms, 2nd edn. Cambridge University Press, Cambridge (2000)","edition":"2"},{"issue":"4","key":"24_CR9","doi-asserted-by":"publisher","first-page":"173","DOI":"10.1016\/S0020-0190(01)00273-3","volume":"82","author":"YH Tsin","year":"2002","unstructured":"Tsin, Y.H.: Some remarks on distributed depth-first search. Inf. Process. Lett. 82(4), 173\u2013178 (2002)","journal-title":"Inf. Process. Lett."},{"key":"24_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"190","DOI":"10.1007\/3-540-60218-6_14","volume-title":"CONCUR \u201995: Concurrency Theory","author":"F Vaandrager","year":"1995","unstructured":"Vaandrager, F.: Verification of a distributed summation algorithm. In: Lee, I., Smolka, S.A. (eds.) CONCUR 1995. LNCS, vol. 962, pp. 190\u2013203. Springer, Heidelberg (1995). https:\/\/doi.org\/10.1007\/3-540-60218-6_14"}],"container-title":["Lecture Notes in Computer Science","A Journey from Process Algebra via Timed Automata to Model Learning"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-15629-8_24","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,9,24]],"date-time":"2022-09-24T16:31:24Z","timestamp":1664037084000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-15629-8_24"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"ISBN":["9783031156281","9783031156298"],"references-count":10,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-15629-8_24","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2022]]},"assertion":[{"value":"7 September 2022","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}