We present a combinatorial algorithm for the 1-(S; T)-edge-connectivity augmentation problem in digraphs. The general k-(S; T)-edge-connectivity augmentation problem was rst solved by A. Frank and T. Jordd an, Minimal Edge-coverings by Pairs of Sets, Journal of Combinatorial Theory Ser. B, submitted, but their proof does not yield a polynomial-time algorithm. Our algorithm generalizes an earlie...

Abstract The connectivity is an important measurement for the fault-tolerance of a network. generalized natural generalization classical connectivity. An S S -tree connected graph G G tree T = ( V ? , <m:m...

solute transport processes are affected by soil pore water velocity distribution. pore size distribution, which can be used to infer pore water velocity distribution, can be estimated from a soil water retention curve (n). in this study, a solute breakthrough curve was simulated using soil hydraulic parameters in four different soils. to evaluate the proposed model, predictions were compared to...

BACKGROUND During an experimental session, behavioral performance fluctuates, yet most neuroimaging analyses of functional connectivity derive a single connectivity pattern. These conventional connectivity approaches assume that since the underlying behavior of the task remains constant, the connectivity pattern is also constant. NEW METHOD We introduce a novel method, behavior-regressed conn...

eccentric connectivity index has been found to have a low degeneracy and hence a significantpotential of predicting biological activity of certain classes of chemical compounds. wepresent here explicit formulas for eccentric connectivity index of various families of graphs.we also show that the eccentric connectivity index grows at most polynomially with thenumber of vertices and determine the ...

For a graph G = ( V , E ) and set S ⊆ of size at least 2, an S-Steiner tree T is subgraph that with . Two -Steiner trees ′ are internally disjoint (resp. edge-disjoint if ∩ ∅ ). Let κ λ denote the maximum number edge-disjoint) in The k-tree connectivity k edge-connectivity then defined as minimum ), where ranges over all -subsets In Li et al. (2018) [12] authors conjectured connected has vertic...

Given a set V of n sensor node distributed on a 2-dimensional plane and a source node s ∈ V, the interference problem deals with assigning transmission range to each v ∈ V such that the members in V maintain connectivity predicate P , and the maximum/total interference is minimum. We propose algorithm for both minimizing maximum interference andminimizing total interference of the networks. For...

Status of this Memo This memo provides information for the Internet community. It does not specify an Internet standard of any kind. Distribution of this memo is unlimited. 2. Abstract This document describes addressing and routing strategies for multi-homed enterprises attached to multiple Internet Service Providers (ISPs) that are intended to reduce the routing overhead due to these enterpris...