Tools
Sorted by:
Try your query at:
 |
 |
 |
 |
 |
 |
Results 1 - 10
of
589
Maximum-Bandwidth Node-Disjoint Paths
"... Abstract—This paper presents a new method for finding the node-disjoint paths with maximum combined bandwidth in communication networks. This problem is an NP-complete 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 node-disjoint paths with maximum combined bandwidth in communication networks. This problem is an NP-complete problem which can be optimally solved in exponential time using integer linear programming (ILP). The presented method uses a
Constructing Node-Disjoint 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 node-disjoint paths between any two distinct nodes and the upper bound of the ω-wide-diameter of an EPM. This result shows that the EPMs have smaller ω-wide-diameters than the PMs.
Edge- and Node-Disjoint 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 node-disjoint 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 node-disjoint 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
Node-Disjoint Paths on the Mesh and a New Trade-Off in VLSI Layout
, 1996
"... A number of basic models for VLSI layout are based on the construction of nodedisjoint paths between terminals on a multi-layer 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 upper-bound trade-off between these two quantities in a general multi-layer 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 node-disjoint 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 node-disjoint 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 node-disjoint paths in a single sequence of request-reply cycle. However, one can guarantee to iden ..."
Abstract
-
Cited by 5 (0 self)
- Add to MetaCart
Abstract: Identifying a maximal set of node-disjoint 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 node-disjoint paths in a single sequence of request-reply cycle. However, one can guarantee
One-to-many node-disjoint 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 node-disjoint 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 node-disjoint paths, one from each target node to the source. The collection of paths output from the algorithm
Minimum Activation Cost Node-Disjoint 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 mono-tone non-decreasing activation functions from D2 to {0, 1}, where D is a constant-size subset of the non-negative 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 connectiv-ity requirements. We propose algorithms that optimally solve the min-imum activation cost of k node-disjoint st-paths (st-MANDP) problem in O(tw((5 + tw)|D|)2tw+2|V |3) time and the minimum activation
A Distributed Routing Protocol for Finding Two Node-Disjoint Paths in Computer Networks
, 1999
"... In this paper, we propose a distributed routing protocol for finding two node-disjoint 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 node-disjoint paths between each pair of nodes in a computer network.
Poly-logarithmic 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 source-sink pairs. The goal is to select a maximum cardinality subset of pairs that can be routed/connected via node-di ..."
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 source-sink pairs. The goal is to select a maximum cardinality subset of pairs that can be routed/connected via node-disjoint
Results 1 - 10
of
589
