Edge- and Node-Disjoint Paths in P Systems
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 stand...
| Main Authors: | , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Open Publishing Association
2010-10-01
|
| Series: | Electronic Proceedings in Theoretical Computer Science |
| Online Access: | http://arxiv.org/pdf/1011.0495v1 |
| id |
doaj-3682f6ce5ff349bf9cee172c147223a4 |
|---|---|
| record_format |
Article |
| spelling |
doaj-3682f6ce5ff349bf9cee172c147223a42020-11-24T21:24:05ZengOpen Publishing AssociationElectronic Proceedings in Theoretical Computer Science2075-21802010-10-0140Proc. MeCBIC 201012114110.4204/EPTCS.40.9Edge- and Node-Disjoint Paths in P SystemsMichael J. DinneenYun-Bum KimRadu NicolescuIn 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 neighbors. For the node-disjoint version, our P system rules are designed to enforce node weight capacities (of one), in addition to edge capacities (of one), which are not readily available in the standard network flow algorithms. http://arxiv.org/pdf/1011.0495v1 |
| collection |
DOAJ |
| language |
English |
| format |
Article |
| sources |
DOAJ |
| author |
Michael J. Dinneen Yun-Bum Kim Radu Nicolescu |
| spellingShingle |
Michael J. Dinneen Yun-Bum Kim Radu Nicolescu Edge- and Node-Disjoint Paths in P Systems Electronic Proceedings in Theoretical Computer Science |
| author_facet |
Michael J. Dinneen Yun-Bum Kim Radu Nicolescu |
| author_sort |
Michael J. Dinneen |
| title |
Edge- and Node-Disjoint Paths in P Systems |
| title_short |
Edge- and Node-Disjoint Paths in P Systems |
| title_full |
Edge- and Node-Disjoint Paths in P Systems |
| title_fullStr |
Edge- and Node-Disjoint Paths in P Systems |
| title_full_unstemmed |
Edge- and Node-Disjoint Paths in P Systems |
| title_sort |
edge- and node-disjoint paths in p systems |
| publisher |
Open Publishing Association |
| series |
Electronic Proceedings in Theoretical Computer Science |
| issn |
2075-2180 |
| publishDate |
2010-10-01 |
| description |
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 neighbors. For the node-disjoint version, our P system rules are designed to enforce node weight capacities (of one), in addition to edge capacities (of one), which are not readily available in the standard network flow algorithms. |
| url |
http://arxiv.org/pdf/1011.0495v1 |
| work_keys_str_mv |
AT michaeljdinneen edgeandnodedisjointpathsinpsystems AT yunbumkim edgeandnodedisjointpathsinpsystems AT radunicolescu edgeandnodedisjointpathsinpsystems |
| _version_ |
1725989728871776256 |