8 search results - page 2 / 2 » Constructions for Cubic Graphs with Large Girth |
MFCS
2007
Springer
13 years 11 months ago
2007
Springer
Abstract. We study the existence and tractability of a notion of approximate equilibria in bimatrix games, called well supported approximate Nash Equilibria (SuppNE in short). We p...
LICS
2010
IEEE
13 years 3 months ago
2010
IEEE
We construct finite groups whose Cayley graphs have large girth even w.r.t. a discounted distance measure that contracts arbitrarily long sequences of edges from the same colour ...
ICALP
2010
Springer
13 years 10 months ago
2010
Springer
We consider the problem of efficiently finding an additive C-spanner of an undirected unweighted graph G, that is, a subgraph H so that for all pairs of vertices u, v, δH (u, v) ...