97 search results - page 11 / 20 » Graphs of arbitrary excessive class |
SIGECOM
2004
ACM
15 years 3 months ago
2004
ACM
We provide efficient algorithms for finding approximate BayesNash equilibria (BNE) in graphical, specifically tree, games of incomplete information. In such games an agent’s p...
ESA
2006
Springer
15 years 1 months ago
2006
Springer
A coloring is proper if each color class induces connected components of order one (where the order of a graph is its number of vertices). Here we study relaxations of proper two-c...
WG
2010
Springer
14 years 8 months ago
2010
Springer
In this paper we investigate the basic problem of Exploration of a graph by a group of identical mobile computational entities, called robots, operating autonomously and asynchrono...
APPROX
2010
Springer
14 years 11 months ago
2010
Springer
Abstract. We provide improved approximation algorithms for the minmax generalization problems considered by Du, Eppstein, Goodrich, and Lueker [1]. In min-max generalization proble...
70
Voted
INFOCOM
2008
IEEE
15 years 4 months ago
2008
IEEE
—It is important in communication networks to use routes that are as short as possible (i.e have low stretch) while keeping routing tables small. Recent advances in compact routi...