803 search results - page 158 / 161 » Independence in Direct-Product Graphs |
CORR
2010
Springer
13 years 8 months ago
2010
Springer
Bargaining networks model the behavior of a set of players who need to reach pairwise agreements for making profits. Nash bargaining solutions in this context correspond to soluti...
CORR
2010
Springer
13 years 8 months ago
2010
Springer
The overlap number of a finite (d + 1)-uniform hypergraph H is the largest constant c(H) (0, 1] such that no matter how we map the vertices of H into Rd , there is a point covered...
CORR
2008
Springer
13 years 8 months ago
2008
Springer
We consider concurrent games played on graphs. At every round of the game, each player simultaneously and independently selects a move; the moves jointly determine the transition ...
CORR
2008
Springer
13 years 8 months ago
2008
Springer
In this paper, we propose a general cross-layer optimization framework in which we explicitly consider both the heterogeneous and dynamically changing characteristics of delay-sens...
BMCBI
2006
13 years 8 months ago
2006
Background: Recently there has been a lot of interest in identifying modules at the level of genetic and metabolic networks of organisms, as well as in identifying single genes an...