Instruct: Identify the main and secondary category of Arxiv papers based on the titles and abstracts
Query: 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 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.

2
The categories of this paper are: math
4
The categories of this paper are: cond-mat
6
The categories of this paper are: astro-ph
25
The categories of this paper are: patt-sol
9
The categories of this paper are: nlin
0
The categories of this paper are: hep-ph
11
The categories of this paper are: hep-lat
22
The categories of this paper are: chao-dyn
26
The categories of this paper are: bayes-an
23
The categories of this paper are: solv-int
37
The categories of this paper are: supr-con
30
The categories of this paper are: q-alg
14
The categories of this paper are: math-ph
33
The categories of this paper are: plasm-ph
27
The categories of this paper are: comp-gas
32
The categories of this paper are: atom-ph