966 search results - page 55 / 194 » Small Alliances in Graphs |
161
click to vote
CORR
2008
Springer
15 years 6 months ago
2008
Springer
We present a deterministic way of assigning small (log bit) weights to the edges of a bipartite planar graph so that the minimum weight perfect matching becomes unique. The isolati...
149
click to vote
EJC
2007
15 years 6 months ago
2007
We introduce and study online balanced coloring games on the random graph process. The game is played by a player we call Painter. Edges of the complete graph with n vertices are ...
150
click to vote
CPC
1998
15 years 5 months ago
1998
Given a sequence of non-negative real numbers 0 1 ::: which sum to 1, we consider a random graph having approximately in vertices of degree i. In 12] the authors essentially show ...
218
click to vote
ICASSP
2011
IEEE
14 years 9 months ago
2011
IEEE
We design two different strategies for computing the unknown content preferences in an online social network based on a small set of nodes in the corresponding social graph for wh...
158
click to vote
WG
2004
Springer
15 years 11 months ago
2004
Springer
In portable multimedia systems a number of communicating tasks has to be performed on a set of heterogeneous processors. This should be done in an energy-efficient way. We give th...