BFS solution for disjoint paths in P systems

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 6714 LNCS, Issue , 2011, Pages 164-176

  Nicolescu, Radu ^a   Wu, Huiling ^a  

^a UNIVERSITY OF AUCKLAND   (New Zealand)

Author keywords

breadth first search; depth first search; edge disjoint paths; network flow; node disjoint paths; P systems

Indexed keywords

BREADTH-FIRST SEARCH; DEPTH FIRST SEARCH; EDGE-DISJOINT PATHS; NETWORK FLOW; NODE-DISJOINT PATHS; P SYSTEMS; EDGE DISJOINT PATHS; NETWORK FLOWS;

COMPUTER SCIENCE; COMPUTERS;

ARTIFICIAL INTELLIGENCE;

EID: 79959294930     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-21341-0_20     Document Type: Conference Paper

References (18)

1. Cormen, T.H., Stein, C., Rivest, R.L., Leiserson, C.E.: Introduction to Algorithms, 3rd edn. The MIT Press, Cambridge (2009)
2. Dinic, E.A.: Algorithm for solution of a problem of maximum flow in a network with power estimation. Soviet Math. Dokl. 11, 1277-1280 (1970)
3. Dinneen, M.J., Kim, Y.B., Nicolescu, R.: Edge- and node-disjoint paths in P systems. Electronic Proceedings in Theoretical Computer Science 40, 121-141 (2010)
4. Edmonds, J., Karp, R.M.: Theoretical improvements in algorithmic efficiency for network flow problems. J. ACM 19(2), 248-264 (1972)
5. Ford Jr., L.R., Fulkerson, D.R.: Maximal flow through a network. Canadian Journal of Mathematics 8, 399-404 (1956)
6. Goldberg, A.V., Tarjan, R.E.: A new approach to the maximum flow problem. Journal of the ACM 35(4), 921-940 (1988)
7. Ionescu, M., Sburlan, D.: On P systems with promoters/inhibitors. Journal of Universal Computer Science 10(5), 581-599 (2004) (Pubitemid 41151385)
8. Kozen, D.C.: The Design and Analysis of Algorithms. Springer, New York (1991)
9. Lynch, N.A.: Distributed Algorithms. Morgan Kaufmann Publishers Inc., San Francisco (1996)
10. Mart́n-Vide, C., Paun, G., Pazos, J., Rodŕguez-Pat́on, A.: Tissue P systems. Theor. Comput. Sci. 296(2), 295-326 (2003)
11. Nicolescu, R., Dinneen, M.J., Kim, Y.B.: Structured modelling with hyper-dag P systems: Part A. Report CDMTCS-342, Centre for Discrete Mathematics and Theoretical Computer Science, The University of Auckland, Auckland, New Zealand (December 2008), http://www.cs.auckland.ac.nz/CDMTCS/researchreports/ 342hyperdagA.pdf
12. Nicolescu, R., Dinneen, M.J., Kim, Y.B.: Structured modelling with hyper-dag P systems: Part B. Report CDMTCS-373, Centre for Discrete Mathematics and Theoretical Computer Science, The University of Auckland, Auckland, New Zealand (October 2009), http://www.cs.auckland.ac.nz/CDMTCS//researchreports/ 373hP-B.pdf
13. Nicolescu, R., Dinneen, M.J., Kim, Y.B.: Towards structured modelling with hy-perdag P systems. International Journal of Computers, Communications and Control 2, 209-222 (2010)
14. Nicolescu, R., Wu, H.: BFS solution for disjoint paths in P systems. Report CDMTCS-399, Centre for Discrete Mathematics and Theoretical Computer Science, The University of Auckland, Auckland, New Zealand (March 2011), http://www.cs.auckland.ac.nz/CDMTCS//researchreports/399radu.pdf
15. Paun, G.: Membrane Computing: An Introduction. Springer-Verlag New York, Inc., Secaucus (2002)
16. Paun, G.: Introduction to membrane computing. In: Ciobanu, G., Ṕerez-Jiḿenez, M.J., Paun, G. (eds.) Applications of Membrane Computing. Natural Computing Series, pp. 1-42. Springer, Heidelberg (2006)
17. Paun, G., Centre, T., Science, C.: Computing with membranes. Journal of Computer and System Sciences 61, 108-143 (1998)
18. Seo, D., Thottethodi, M.: Disjoint-path routing: Efficient communication for streaming applications. In: IPDPS, pp. 1-12. IEEE, Los Alamitos (2009)