Results 1 
1 of
1
On the Maximum Number of Linearly Independent Cycles and Paths in a Network
, 2012
"... We consider the problem of identifying additive link metrics in an arbitrary undirected network using measurement nodes and establishing paths/cycles between them. For a given placement of measurement nodes, we define and derive the “link rank” of the network—the maximum number of linearly independe ..."
Abstract

Cited by 3 (0 self)
 Add to MetaCart
We consider the problem of identifying additive link metrics in an arbitrary undirected network using measurement nodes and establishing paths/cycles between them. For a given placement of measurement nodes, we define and derive the “link rank” of the network—the maximum number of linearly independent cycles/paths that may be established between the measurement nodes. We develop a polynomial time algorithm to compute a set of cycles/paths that achieves the maximum rank.