1493 search results - page 27 / 299 » Local resilience of graphs |
VALUETOOLS
2006
ACM
14 years 1 months ago
2006
ACM
We present the software tool “Web Graph Analyzer”. This tool is designed to perform a comprehensive analysis of the Web Graph structure. By Web Graph we mean a graph whose ver...
DAM
2008
13 years 7 months ago
2008
Let G = (V + s, E) be a 2-edge-connected graph with a designated vertex s. A pair of edges rs, st is called admissible if splitting off these edges (replacing rs and st by rt) pre...
IM
2007
13 years 7 months ago
2007
A local graph partitioning algorithm finds a cut near a specified starting vertex, with a running time that depends largely on the size of the small side of the cut, rather than...
CCCG
2010
13 years 9 months ago
2010
A dominating set of a graph G = (V, E) is a subset V V of the nodes such that for all nodes v V , either v V or a neighbor u of v is in V . Several routing protocols in ad hoc ...
TIT
2011
13 years 2 months ago
2011
—“If we know more, we can achieve more.” This adage also applies to networks, where more information about the network state translates into higher sum-rates. In this paper, ...