367 search results - page 52 / 74 » Set connectivity problems in undirected graphs and the direc... |
JCSS
2000
13 years 7 months ago
2000
It is a well-known result of Fagin that the complexity class NP coincides with the class of problems expressible in existential second-order logic ( 1 1), which allows sentences c...
ICDCS
2010
IEEE
13 years 9 months ago
2010
IEEE
Abstract—Coverage problem is a fundamental issue in wireless ad hoc and sensor networks. Previous techniques for coverage scheduling often require accurate location information o...
ICASSP
2011
IEEE
12 years 11 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...
IWCMC
2006
ACM
14 years 1 months ago
2006
ACM
Securing multicast communications in ad hoc networks has become one of the most challenging research directions in the areas of wireless networking and security. This is especiall...
TOC
2008
13 years 7 months ago
2008
For an integer h 1, an elementary h-route flow is a flow along h edge disjoint paths between a source and a sink, each path carrying a unit of flow, and a single commodity h-rout...