4865 search results - page 545 / 973 » The Complexity of Graph Connectivity |
199
click to vote
CONEXT
2010
ACM
15 years 5 months ago
2010
ACM
Client-server networks are pervasive, fundamental, and include such key networks as the Internet, power grids, and road networks. In a client-server network, clients obtain a serv...
236
click to vote
INFOCOM
2010
IEEE
15 years 5 months ago
2010
IEEE
We address the problem of efficiently gathering correlated data from a wireless sensor network, with the aim of designing algorithms with provable optimality guarantees, and unders...
245
click to vote
ISBI
2011
IEEE
14 years 11 months ago
2011
IEEE
High angular resolution diffusion imaging (HARDI) allows in vivo analysis of the white matter structure and connectivity. Based on orientation distribution functions (ODFs) that r...
220
click to vote
TON
2012
13 years 10 months ago
2012
—Society relies heavily on its networked physical infrastructure and information systems. Accurately assessing the vulnerability of these systems against disruptive events is vit...
240
click to vote
SODA
2012
ACM
13 years 10 months ago
2012
ACM
Given an integer h, a graph G = (V, E) with arbitrary positive edge capacities and k pairs of vertices (s1, t1), (s2, t2), . . . , (sk, tk), called terminals, an h-route cut is a ...