Edge- and Node-Disjoint Paths in P Systems

@inproceedings{Dinneen2010EdgeAN,
  title={Edge- and Node-Disjoint Paths in P Systems},
  author={Michael J. Dinneen and Yun-Bum Kim and Radu Nicolescu},
  booktitle={MeCBIC},
  year={2010}
}
  • Michael J. Dinneen, Yun-Bum Kim, Radu Nicolescu
  • Published in MeCBIC 2010
  • Computer Science
  • In this paper, we continue our development of algorithms used for topological network discovery. We present native P system versions of two fundamental problems in graph theory: finding the maximum number of edge- and node-disjoint paths between a source node and target node. We start from the standard depth-first-search maximum flow algorithms, but our approach is totally distributed, when initially no structural information is available and each P system cell has to even learn its immediate… CONTINUE READING

    Create an AI-powered research feed to stay up to date with new papers like this posted to ArXiv

    Citations

    Publications citing this paper.
    SHOWING 1-10 OF 10 CITATIONS

    References

    Publications referenced by this paper.
    SHOWING 1-10 OF 14 REFERENCES

    P systems and the Byzantine agreement

    VIEW 5 EXCERPTS

    Maximal Flow through a Network.

    VIEW 8 EXCERPTS
    HIGHLY INFLUENTIAL

    A Faster P Solution for the Byzantine Agreement Problem

    VIEW 2 EXCERPTS

    Discovering the Membrane Topology of Hyperdag P Systems

    VIEW 1 EXCERPT

    Cdmtcs Research Report Series Structured Modelling with Hyperdag P Systems: Part a Structured Modelling with Hyperdag P Systems: Part A

    • Radu Nicolescu, Michael J Dinneen, Yun-Bum Kim
    • 2008
    VIEW 2 EXCERPTS

    Introduction to Membrane Computing

    • Gheorghe Paun
    • Computer Science
    • Applications of Membrane Computing
    • 2006
    VIEW 1 EXCERPT

    Membrane Computing: An Introduction

    VIEW 2 EXCERPTS

    Computing with Membranes