1493 search results - page 174 / 299 » Local resilience of graphs |
106
click to vote
JGT
2007
15 years 4 months ago
2007
Let Γ be an infinite, locally finite, connected graph with distance function δ. Given a ray P in Γ and a constant C ≥ 1, a vertex-sequence {xn}∞ n=0 ⊆ V P is said to be...
111
click to vote
NJC
1998
15 years 4 months ago
1998
The problem of routing permutations on graphs via matchings is considered, and we present a general algorithm which can be parameterized by different heuristics. This leads to a ...
142
click to vote
ISAAC
2005
Springer
15 years 10 months ago
2005
Springer
Consider an information network with harmful procedures called attackers (e.g., viruses); each attacker uses a probability distribution to choose a node of the network to damage. O...
165
click to vote
ATAL
2010
Springer
15 years 5 months ago
2010
Springer
We consider the computational complexity of pure Nash equilibria in graphical games. It is known that the problem is NP-complete in general, but tractable (i.e., in P) for special...
129
click to vote
CONEXT
2009
ACM
15 years 5 months ago
2009
ACM
Network traffic can be represented by a Traffic Dispersion Graph (TDG) that contains an edge between two nodes that send a particular type of traffic (e.g., DNS) to one another. T...