{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,4,29]],"date-time":"2025-04-29T22:10:03Z","timestamp":1745964603740,"version":"3.40.4"},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642367502"},{"type":"electronic","value":"9783642367519"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-36751-9_13","type":"book-chapter","created":{"date-parts":[[2013,2,21]],"date-time":"2013-02-21T06:55:13Z","timestamp":1361429713000},"page":"173-194","source":"Crossref","is-referenced-by-count":2,"title":["Fast Distributed DFS Solutions for Edge-Disjoint Paths in Digraphs"],"prefix":"10.1007","author":[{"given":"Hossam","family":"ElGindy","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Radu","family":"Nicolescu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Huiling","family":"Wu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"2","key":"13_CR1","doi-asserted-by":"publisher","first-page":"1","DOI":"10.4018\/jncr.2011040101","volume":"2","author":"T. B\u0103l\u0103nescu","year":"2011","unstructured":"B\u0103l\u0103nescu, T., Nicolescu, R., Wu, H.: Asynchronous P systems. International Journal of Natural Computing Research\u00a02(2), 1\u201318 (2011)","journal-title":"International Journal of Natural Computing Research"},{"key":"13_CR2","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.\u00a026, 301\u2013305 (1988)","journal-title":"Inf. Process. Lett."},{"key":"13_CR3","unstructured":"Dinneen, M.J., Kim, Y.B., Nicolescu, R.: Edge- and vertex-disjoint paths in P\u00a0modules. In: Ciobanu, G., Koutny, M. (eds.) Workshop on Membrane Computing and Biologically Inspired Process Calculi, pp. 117\u2013136 (2010)"},{"key":"13_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"175","DOI":"10.1007\/978-3-642-18123-8_15","volume-title":"Membrane Computing","author":"M.J. Dinneen","year":"2010","unstructured":"Dinneen, M.J., Kim, Y.-B., Nicolescu, R.: A Faster P\u00a0Solution for the Byzantine Agreement Problem. In: Gheorghe, M., Hinze, T., P\u0103un, G., Rozenberg, G., Salomaa, A. (eds.) CMC 2010. LNCS, vol.\u00a06501, pp. 175\u2013197. Springer, Heidelberg (2010)"},{"key":"13_CR5","doi-asserted-by":"publisher","first-page":"399","DOI":"10.4153\/CJM-1956-045-5","volume":"8","author":"L.R. Ford Jr.","year":"1956","unstructured":"Ford Jr., L.R., Fulkerson, D.R.: Maximal flow through a network. Canadian Journal of Mathematics\u00a08, 399\u2013404 (1956)","journal-title":"Canadian Journal of Mathematics"},{"issue":"2","key":"13_CR6","first-page":"105","volume":"1","author":"R. Freund","year":"1995","unstructured":"Freund, R., P\u0103un, G.: A variant of team cooperation in grammar systems. Journal of Universal Computer Science\u00a01(2), 105\u2013130 (1995)","journal-title":"Journal of Universal Computer Science"},{"key":"13_CR7","doi-asserted-by":"crossref","unstructured":"Hagberg, A.A., Schult, D.A., Swart, P.J.: Exploring Network Structure, Dynamics, and Function using NetworkX. In: Varoquaux, G., Vaught, T., Millman, J. (eds.) 7th Python in Science Conference (SciPy), pp. 11\u201315 (2008)","DOI":"10.25080\/TCWV9851"},{"key":"13_CR8","doi-asserted-by":"crossref","unstructured":"Karp, R.M.: Reducibility Among Combinatorial Problems. In: Miller, R.E., Thatcher, J.W. (eds.) Complexity of Computer Computations, pp. 85\u2013103. Plenum Press (1972)","DOI":"10.1007\/978-1-4684-2001-2_9"},{"key":"13_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"35","DOI":"10.1007\/978-3-642-28024-5_4","volume-title":"Membrane Computing","author":"R. Nicolescu","year":"2012","unstructured":"Nicolescu, R.: Parallel and Distributed Algorithms in P\u00a0Systems. In: Gheorghe, M., P\u0103un, G., Rozenberg, G., Salomaa, A., Verlan, S. (eds.) CMC 2011. LNCS, vol.\u00a07184, pp. 35\u201350. Springer, Heidelberg (2012)"},{"key":"13_CR10","doi-asserted-by":"crossref","unstructured":"Nicolescu, R., Wu, H.: New solutions for disjoint paths in P systems. Natural Computing, 1\u201315 (2012), doi:10.1007\/s11047-012-9342-9","DOI":"10.1007\/s11047-012-9342-9"},{"issue":"1","key":"13_CR11","doi-asserted-by":"publisher","first-page":"108","DOI":"10.1006\/jcss.1999.1693","volume":"61","author":"G. P\u0103un","year":"2000","unstructured":"P\u0103un, G.: Computing with membranes. Journal of Computer and System Sciences\u00a061(1), 108\u2013143 (2000)","journal-title":"Journal of Computer and System Sciences"},{"key":"13_CR12","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-11467-0","volume-title":"The Oxford Handbook of Membrane Computing","author":"G. P\u0103un","year":"2010","unstructured":"P\u0103un, G., Rozenberg, G., Salomaa, A.: The Oxford Handbook of Membrane Computing. Oxford University Press, Inc., New York (2010)"},{"key":"13_CR13","doi-asserted-by":"crossref","unstructured":"Tel, G.: Introduction to Distributed Algorithms. Cambridge University Press (2000)","DOI":"10.1017\/CBO9781139168724"}],"container-title":["Lecture Notes in Computer Science","Membrane Computing"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-36751-9_13","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,4,29]],"date-time":"2025-04-29T21:51:36Z","timestamp":1745963496000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-36751-9_13"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642367502","9783642367519"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-36751-9_13","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2013]]}}}