2008 49th Annual IEEE Symposium on Foundations ofâ€¦

2008

Given a complete undirected graph, a cost function on edges and a degree bound B, the degree bounded network design problem is to find a minimum cost simple subgraph with maximum degree B satisfyingâ€¦ (More)

We present new edge splitting-off results maintaining all-pairs edge-connectivities of an undirected graph. We first give an alternate proof of Maderâ€™s theorem, and use it to obtain a deterministicâ€¦ (More)

A state i is said to be transient if fii < 1; and it is said to be persistent if fii = 1. Denote by q = (q 1, q t 2, . . . , q t n) the state probability vector (the distribution of the chain at timeâ€¦ (More)