Results 1  10
of
14,785
On Rooted NodeConnectivity Problems
, 1999
"... Let G be a graph which is koutconnected from a specified root node r, that is, G has k openly disjoint paths between r and v for every node v. We give necessary and sufficient conditions for the existence of a pair rv; rw of edges for which replacing these edges by a new edge vw gives a graph th ..."
Abstract

Cited by 11 (4 self)
 Add to MetaCart
that is koutconnected from r. This generalizes a theorem of Bienstock, Brickell and Monma on splitting off edges while preserving knodeconnectivity. We also prove that if C is a cycle in G such that each edge in C is critical with respect to koutconnectivity from r, then C has a node v, distinct from
SIGNAL CLASSIFICATION BY MATCHING NODE CONNECTIVITIES
"... We propose a simple and efficient way for pattern recognition and signal classification within the Diffusion Framework. Our proposed Node Connectivity Matching (NCM) method is derived from the diffusion distance. However, instead of computing the eigenvalues/eigenvectors of the normalized diffusi ..."
Abstract
 Add to MetaCart
We propose a simple and efficient way for pattern recognition and signal classification within the Diffusion Framework. Our proposed Node Connectivity Matching (NCM) method is derived from the diffusion distance. However, instead of computing the eigenvalues/eigenvectors of the normalized diffu
Degree Constrained NodeConnectivity Problems
 ALGORITHMICA
"... We consider Degree Constrained Survivable Network problems. For ... slightly improve the best known approximation ratio, by a simple proof. Our main contribution is giving a framework to handle nodeconnectivity degree constrained problems with the iterative rounding method. In particular, for the d ..."
Abstract
 Add to MetaCart
We consider Degree Constrained Survivable Network problems. For ... slightly improve the best known approximation ratio, by a simple proof. Our main contribution is giving a framework to handle nodeconnectivity degree constrained problems with the iterative rounding method. In particular
Approximating nodeconnectivity augmentation problems
 In Proceedings APPROXRANDOM, Lecture Notes in Computer Science
, 2009
"... We consider the (undirected) Node Connectivity Augmentation (NCA) problem: given a graph J = (V,EJ) and connectivity requirements {r(u,v) : u,v ∈ V}, find a minimum size set I of new edges (any edge is allowed) such that the graph J ∪ I contains r(u,v) internallydisjoint uvpaths, for all u,v ∈ V. ..."
Abstract

Cited by 7 (7 self)
 Add to MetaCart
We consider the (undirected) Node Connectivity Augmentation (NCA) problem: given a graph J = (V,EJ) and connectivity requirements {r(u,v) : u,v ∈ V}, find a minimum size set I of new edges (any edge is allowed) such that the graph J ∪ I contains r(u,v) internallydisjoint uvpaths, for all u,v ∈ V
Critical Power for Asymptotic Connectivity in Wireless Networks
, 1998
"... : In wireless data networks each transmitter's power needs to be high enough to reach the intended receivers, while generating minimum interference on other receivers sharing the same channel. In particular, if the nodes in the network are assumed to cooperate in routing each others ' pack ..."
Abstract

Cited by 541 (19 self)
 Add to MetaCart
; packets, as is the case in ad hoc wireless networks, each node should transmit with just enough power to guarantee connectivity in the network. Towards this end, we derive the critical power a node in the network needs to transmit in order to ensure that the network is connected with probability one
A generalized processor sharing approach to flow control in integrated services networks: The singlenode case
 IEEE/ACM TRANSACTIONS ON NETWORKING
, 1993
"... The problem of allocating network resources to the users of an integrated services network is investigated in the context of ratebased flow control. The network is assumed to be a virtual circuit, connectionbased packet network. We show that the use of Generalized processor Sharing (GPS), when co ..."
Abstract

Cited by 2010 (5 self)
 Add to MetaCart
The problem of allocating network resources to the users of an integrated services network is investigated in the context of ratebased flow control. The network is assumed to be a virtual circuit, connectionbased packet network. We show that the use of Generalized processor Sharing (GPS), when
Pastry: Scalable, distributed object location and routing for largescale peertopeer systems
, 2001
"... This paper presents the design and evaluation of Pastry, a scalable, distributed object location and routing scheme for widearea peertopeer applications. Pastry provides applicationlevel routing and object location in a potentially very large overlay network of nodes connected via the Internet. ..."
Abstract

Cited by 2075 (49 self)
 Add to MetaCart
This paper presents the design and evaluation of Pastry, a scalable, distributed object location and routing scheme for widearea peertopeer applications. Pastry provides applicationlevel routing and object location in a potentially very large overlay network of nodes connected via the Internet
Results 1  10
of
14,785