Edge- and node-disjoint paths in P systems

Electronic Proceedings in Theoretical Computer Science, EPTCS

Volumn 40, Issue , 2010, Pages 121-141

  Dinneen, Michael J ^a   Kim, Yun Bum ^a   Nicolescu, Radu ^a  

^a UNIVERSITY OF AUCKLAND   (New Zealand)

Author keywords

Breadth first search; Cell IDs; Depth first search; Distributed algorithms; Edge disjoint paths; Network discovery; Network flow; Node disjoint paths; P modules; P systems; Routing; Simple P modules; Synchronous networks

Indexed keywords

BIOINFORMATICS; COMPUTATION THEORY; PARALLEL ALGORITHMS; PATHOLOGY; SEARCH ENGINES;

BREADTH-FIRST SEARCH; CELL IDS; DEPTH FIRST SEARCH; EDGE DISJOINT PATHS; NETWORK DISCOVERY; NETWORK FLOWS; NODE-DISJOINT PATHS; P MODULES; P SYSTEMS; ROUTING; SIMPLE P MODULES; SYNCHRONOUS NETWORKS;

GRAPH THEORY;

EID: 84975279481     PISSN: 20752180     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.4204/EPTCS.40.9     Document Type: Conference Paper

References (17)

1. Michael J. Dinneen, Yun-Bum Kim & Radu Nicolescu (2009): New Solutions to the Firing Squad Synchronization Problem for Neural and Hyperdag P Systems. In: Membrane Computing and Biologically Inspired Process Calculi, Third Workshop, MeCBIC 2009, Bologna, Italy, September 5, 2009, pp. 117-130.
2. Michael J. Dinneen, Yun-Bum Kim & Radu Nicolescu (2010): A Faster P Solution for the Byzantine Agreement Problem. In: Eleventh International Conference on Membrane Computing, CMC11, Jena, Germany, August 24-27, 2010, p. 26pp.
3. Michael J. Dinneen, Yun-Bum Kim & Radu Nicolescu (2010): P systems and the Byzantine agreement. Journal of Logic and Algebraic Programming 79(6), pp. 334-349. Available at http://www.sciencedirect. com/science/article/B6W8D-4YPPPW1-2/2/17b82b2cdd8f159b7fea380939193e4d. Membrane computing and programming.
4. Jack Edmonds & Richard M. Karp (1972): Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems. J. ACM 19(2), pp. 248-264. Available at http://doi.acm.org/10.1145/321694. 321699.
5. Lester R. Ford Jr. & D. Ray Fulkerson (1956): Maximal flow through a network. Canadian Journal of Mathematics 8, pp. 399-404.
6. Nancy A. Lynch (1996): Distributed Algorithms. Morgan Kaufmann Publishers Inc., San Francisco, CA, USA.
7. Carlos Martín-Vide, Gheorghe Pǎun, Juan Pazos & Alfonso Rodríguez-Patón (2003): Tissue P systems. Theor. Comput. Sci. 296(2), pp. 295-326. Available at http://dx.doi.org/10.1016/S0304-3975(02) 00659-X.
8. Karl Menger (1927): Zur allgemeinen Kurventheorie. Fundamenta Mathematicae 10, pp. 96-115.
9. Radu Nicolescu, Michael J. Dinneen & Yun-Bum Kim (2009): Discovering the Membrane Topology of Hyperdag P Systems. In: Gheorghe Pǎun, Mario J. Pérez-Jiménez, Agustín Riscos-Núñez, Grzegorz Rozenberg & Arto Salomaa, editors: Workshop on Membrane Computing, Lecture Notes in Computer Science 5957, Springer-Verlag, pp. 410-435.
10. Radu Nicolescu, Michael J. Dinneen & Yun-Bum Kim (2009): Structured Modelling with Hyperdag P Systems: Part A. In: Rosa Gutiérrez-Escudero, Miguel A. Gutiérrez-Naranjo, Gheorghe Pǎun & Ignacio Pérez-Hurtado, editors: Brainstorming Week on Membrane Computing, 2, Universidad de Sevilla, pp. 85-107.
11. Radu Nicolescu, Michael J. Dinneen & Yun-Bum Kim (2010): Towards Structured Modelling with Hyperdag P Systems. International Journal of Computers, Communications and Control 2, pp. 209-222.
12. Gheorghe Pǎun (1998): Computing with Membranes. Technical Report 208, Turku Center for Computer Science-TUCS. (www.tucs.fi).
13. Gheorghe Pǎun (2002): Membrane Computing: An Introduction. Springer-Verlag New York, Inc., Secaucus, NJ, USA.
14. Gheorghe Pǎun (2006): Introduction to Membrane Computing. In: Gabriel Ciobanu, Mario J. Pérez-Jiménez & Gheorghe Pǎun, editors: Applications of Membrane Computing, Natural Computing Series, Springer, pp. 1-42. Available at http://dx.doi.org/10.1007/3-540-29937-8-1.
15. John T. Robacker (1956): Min-Max Theorems on Shortest Chains and Disjoint Cuts of a Network. Research Memorandum RM-1660, The RAND Corporation, Santa Monica, California.
16. Neil Robertson & Paul D. Seymour (1995): Graph minors. XIII: The disjoint paths problem. J. Comb. Theory Ser. B 63(1), pp. 65-110.
17. Daeho Seo & Mithuna Thottethodi (2009): Disjoint-path routing: Efficient communication for streaming applications. In: IPDPS, IEEE, pp. 1-12. Available at http://dx.doi.org/10.1109/IPDPS.2009. 5161081.