Results 1  10
of
589
MaximumBandwidth NodeDisjoint Paths
"... Abstract—This paper presents a new method for finding the nodedisjoint paths with maximum combined bandwidth in communication networks. This problem is an NPcomplete problem which can be optimally solved in exponential time using integer linear programming (ILP). The presented method uses a maximu ..."
Abstract
 Add to MetaCart
Abstract—This paper presents a new method for finding the nodedisjoint paths with maximum combined bandwidth in communication networks. This problem is an NPcomplete problem which can be optimally solved in exponential time using integer linear programming (ILP). The presented method uses a
Constructing NodeDisjoint Paths in Enhanced Pyramid Networks
"... Abstract. Chen et al. in 2004 proposed a new hierarchy structure, called the enhanced pyramid network (EPM, for short), by replacing each mesh in a pyramid network (PM, for short) with a torus. Recently, some topological properties and communication on the EPMs have been investigated or derived. The ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
. Their results have revealed that an EPM is an attractive alternative to a PM. This study investigates the nodedisjoint paths between any two distinct nodes and the upper bound of the ωwidediameter of an EPM. This result shows that the EPMs have smaller ωwidediameters than the PMs.
Edge and NodeDisjoint Paths in P Systems
, 2010
"... 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 nodedisjoint paths between a source node and target node. We start from the stand ..."
Abstract

Cited by 3 (1 self)
 Add to MetaCart
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 nodedisjoint paths between a source node and target node. We start from
An Efficient Construction of Node Disjoint Paths in OTIS Networks
"... Abstract. We investigate the problem of constructing the maximal number of node disjoint paths between two distinct nodes in Swapped/OTIS networks. A general construction of node disjoint paths in any OTIS network with a connected basis network is presented, which is independent of any construction ..."
Abstract
 Add to MetaCart
Abstract. We investigate the problem of constructing the maximal number of node disjoint paths between two distinct nodes in Swapped/OTIS networks. A general construction of node disjoint paths in any OTIS network with a connected basis network is presented, which is independent of any construction
NodeDisjoint Paths on the Mesh and a New TradeOff in VLSI Layout
, 1996
"... A number of basic models for VLSI layout are based on the construction of nodedisjoint paths between terminals on a multilayer grid. In this setting, one is interested in minimizing both the number of layers required and the area of the underlying grid. Building on work of Cutler and Shiloach, and ..."
Abstract

Cited by 7 (1 self)
 Add to MetaCart
, and Aggarwal, Klawe, et al., we prove an upperbound tradeoff between these two quantities in a general multilayer grid model. As a special case of our main result, we obtain significantly improved bounds for the problem of routing a full permutation on the mesh using nodedisjoint paths; our new bound here
A Hybrid Protocol for Identification of a Maximal Set of Node Disjoint Paths in
 INTERNATIONAL ARAB JOURNAL OF INFORMATION TECHNOLOGY (IAJIT)
, 2009
"... Abstract: Identifying a maximal set of nodedisjoint paths between a given source and a destination is a challenging task in mobile ad hoc networks. One cannot guarantee to identify the maximal set of nodedisjoint paths in a single sequence of requestreply cycle. However, one can guarantee to iden ..."
Abstract

Cited by 5 (0 self)
 Add to MetaCart
Abstract: Identifying a maximal set of nodedisjoint paths between a given source and a destination is a challenging task in mobile ad hoc networks. One cannot guarantee to identify the maximal set of nodedisjoint paths in a single sequence of requestreply cycle. However, one can guarantee
Onetomany nodedisjoint paths in (n, k)star graphs
"... We present an algorithm which given a source node and a set of n − 1 target nodes in the (n, k)star graph Sn,k, where all nodes are distinct, builds a collection of n − 1 nodedisjoint paths, one from each target node to the source. The collection of paths output from the algorithm is such that eac ..."
Abstract
 Add to MetaCart
We present an algorithm which given a source node and a set of n − 1 target nodes in the (n, k)star graph Sn,k, where all nodes are distinct, builds a collection of n − 1 nodedisjoint paths, one from each target node to the source. The collection of paths output from the algorithm
Minimum Activation Cost NodeDisjoint Paths in Graphs with Bounded Treewidth
, 2014
"... In activation network problems we are given a directed or undirected graph G = (V,E) with a family {fuv: (u, v) ∈ E} of monotone nondecreasing activation functions from D2 to {0, 1}, where D is a constantsize subset of the nonnegative real numbers, and the goal is to find activation values xv f ..."
Abstract
 Add to MetaCart
for all v ∈ V of minimum total cost∑ v∈V xv such that the activated set of edges satisfies some connectivity requirements. We propose algorithms that optimally solve the minimum activation cost of k nodedisjoint stpaths (stMANDP) problem in O(tw((5 + tw)D)2tw+2V 3) time and the minimum activation
A Distributed Routing Protocol for Finding Two NodeDisjoint Paths in Computer Networks
, 1999
"... In this paper, we propose a distributed routing protocol for finding two nodedisjoint paths between each pair of nodes in a computer network. ..."
Abstract
 Add to MetaCart
In this paper, we propose a distributed routing protocol for finding two nodedisjoint paths between each pair of nodes in a computer network.
Polylogarithmic Approximation for Maximum Node Disjoint Paths with Constant Congestion
"... We consider the Maximum Node Disjoint Paths (MNDP) problem in undirected graphs. The input consists of an undirected graph G = (V, E) and a collection {(s1, t1),..., (sk, tk)} of k sourcesink pairs. The goal is to select a maximum cardinality subset of pairs that can be routed/connected via nodedi ..."
Abstract

Cited by 3 (2 self)
 Add to MetaCart
We consider the Maximum Node Disjoint Paths (MNDP) problem in undirected graphs. The input consists of an undirected graph G = (V, E) and a collection {(s1, t1),..., (sk, tk)} of k sourcesink pairs. The goal is to select a maximum cardinality subset of pairs that can be routed/connected via nodedisjoint
Results 1  10
of
589