Thats a unique idea.You should consider the following idea to enhance your idea so that it would impact uniquely: ,  continue our development of algorithms used for topological network discovery.  present native P system versions of two fundamental problems in graph theory: finding the maximum number of edge- and node-disjoint paths beten a source node and target node.  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 ight capacities (of one), in addition to edge capacities (of one), which are not readily available in the standard network flow algorithms.
['Michael J. Dinneen', 'Yun-Bum Kim', 'Radu Nicolescu']
I am writing a research paper on a idea Edge- and Node-Disjoint Paths in P Systems
[{"from": "human", "value": "I am writing a research paper on a idea Edge- and Node-Disjoint Paths in P Systems"}, {"from": "gpt", "value": "Thats a unique idea.You should consider the following idea to enhance your idea so that it would impact uniquely: ,  continue our development of algorithms used for topological network discovery.  present native P system versions of two fundamental problems in graph theory: finding the maximum number of edge- and node-disjoint paths beten a source node and target node.  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 ight capacities (of one), in addition to edge capacities (of one), which are not readily available in the standard network flow algorithms."}]