370 search results - page 42 / 74 » Computational Study on Dominating Set Problem of Planar Grap... |
INFOCOM
2008
IEEE
15 years 8 months ago
2008
IEEE
—A fundamental problem in wireless networks is to estimate its throughput capacity - given a set of wireless nodes, and a set of connections, what is the maximum rate at which da...
120
click to vote
SIGECOM
2008
ACM
15 years 1 months ago
2008
ACM
This paper studies a virus inoculation game on social networks. A framework is presented which allows the measuring of the windfall of friendship, i.e., how much players benefit i...
119
click to vote
SPAA
2005
ACM
15 years 7 months ago
2005
ACM
We study the admission control problem in general networks. Communication requests arrive over time, and the online algorithm accepts or rejects each request while maintaining the...
130
click to vote
IWPEC
2009
Springer
15 years 8 months ago
2009
Springer
In this paper we initiate a systematic study of the Reduced Degree Spanning Tree problem, where given a digraph D and a nonnegative integer k, the goal is to construct a spanning o...
147
click to vote
SIAMDM
2010
14 years 8 months ago
2010
Abstract. Squaregraphs were originally defined as finite plane graphs in which all inner faces are quadrilaterals (i.e., 4-cycles) and all inner vertices (i.e., the vertices not in...