871 search results - page 129 / 175 » The vertex-cover polynomial of a graph |
WINE
2009
Springer
15 years 4 months ago
2009
Springer
We consider weighted linear congestion games, and investigate how social ignorance, namely lack of information about the presence of some players, affects the inefficiency of pure...
103
click to vote
CORR
2010
Springer
14 years 9 months ago
2010
Springer
Abstract Anna Blasiak Robert Kleinberg Eyal Lubetzky Index Coding has received considerable attention recently motivated in part by applications such as fast video-on-demand and e...
MOBIHOC
2002
ACM
15 years 9 months ago
2002
ACM
Topology control problems are concerned with the assignment of power values to the nodes of an ad hoc network so that the power assignment leads to a graph topology satisfying som...
INFOCOM
2007
IEEE
15 years 4 months ago
2007
IEEE
—We introduce a novel approach to multi-hop routing in wireless networks. Instead of the usual graph description we characterize the network by the packet delivery ratio matrix w...
COCO
2007
Springer
15 years 3 months ago
2007
Springer
We present a deterministic logspace algorithm for solving S-T Connectivity on directed graphs if (i) we are given a stationary distribution of the random walk on the graph in whic...