Recursive dual-net (RDN) is a newly proposed interconnection network for massive parallel computers. The RDN is based on recursive dual-construction of a symmetric base-network. A k-level dualconstruction for k > 0 creates a network containing (2n0) k /2 nodes with node-degree d0 + k, where n0 and d0 are the number of nodes and the node-degree of the base network, respectively. The RDN is a sym...

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 edgeand 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 initi...

We prove that, for every two n-node non-star trees of diameter at most four, there exists an n-node planar graph containing them as edge-disjoint subgraphs.

ad hoc networks are multi-hop wireless networks without a pre-installed infrastructure. such networks are widely used in military applications and in emergency situations as they permit the establishment of a communication network at very short notice with a very low cost. video is very sensitive for packet loss and wireless ad-hoc networks are error prone due to node mobility and weak links. h...

Suppose we concatenate two directed graphs, each isomorphic to a d dimensional butterfly (but not necessarily identical to each other). Select any set of 2k input and 2k output nodes on the resulting graph. Then there exist node disjoint paths from the input nodes to the output nodes. If we take two standard butterflies and permute the order of the layers, then the result holds on sets of any s...

Recently, great efforts have been dedicated to researches on the management of large scale graph based data such as WWW, social networks, biological networks. In the study of graph based data management, node disjoint subgraph homeomorphism relation between graphs is more suitable than (sub)graph isomorphism in many cases, especially in those cases that node skipping and node mismatching are al...

Mobile Ad hoc Networks are highly dynamic networks. Quality of Service (QoS) routing in such networks is usually limited by the network breakage due to either node mobility or energy depletion of the mobile nodes. Also, to fulfill certain quality parameters, presence of multiple node-disjoint paths becomes essential. Such paths aid in the optimal traffic distribution and reliability in case of ...