524 search results - page 87 / 105 » On the Maximum Number of Cliques in a Graph |
169
click to vote
GLOBECOM
2008
IEEE
15 years 7 months ago
2008
IEEE
—Conflict free spectrum allocation for secondary users in cognitive networks is a challenging problem, since the accessible spectrum is shared among users. The problem becomes to...
168
click to vote
PODC
2009
ACM
16 years 6 months ago
2009
ACM
We present a randomized coloring algorithm for the unstructured radio network model, a model comprising autonomous nodes, asynchronous wake-up, no collision detection and an unkno...
150
click to vote
SIGECOM
2006
ACM
16 years 1 days ago
2006
ACM
Graphical games have been proposed as a game-theoretic model of large-scale distributed networks of non-cooperative agents. When the number of players is large, and the underlying...
196
click to vote
PODC
2011
ACM
14 years 9 months ago
2011
ACM
We study several variants of coordinated consensus in dynamic networks. We assume a synchronous model, where the communication graph for each round is chosen by a worst-case adver...
147
click to vote
APPROX
2004
Springer
15 years 11 months ago
2004
Springer
Given an undirected n-node graph and a set C of m cuts, the minimum crossing tree is a spanning tree which minimizes the maximum crossing of any cut in C, where the crossing of a c...