187 search results - page 27 / 38 » The Number of Independent Sets in a Grid Graph |
SPAA
2009
ACM
15 years 6 months ago
2009
ACM
We study deterministic, distributed algorithms for two weak variants of the standard graph coloring problem. We consider defective colorings, i.e., colorings where nodes of a colo...
111
click to vote
COCOON
2000
Springer
15 years 4 months ago
2000
Springer
We consider the parameterized complexity of the following problem under the framework introduced by Downey and Fellows[4]: Given a graph G, an integer parameter k and a non-trivial...
106
click to vote
PODC
2011
ACM
14 years 2 months ago
2011
ACM
In this paper we study the problem of building a connected dominating set with constant degree (CCDS) in the dual graph radio network model [4,9,10]. This model includes two types...
103
click to vote
ICDM
2008
IEEE
15 years 6 months ago
2008
IEEE
In this work, we study the problem of within-network relational learning and inference, where models are learned on a partially labeled relational dataset and then are applied to ...
SODA
2007
ACM
15 years 1 months ago
2007
ACM
Random geometric graphs have been one of the fundamental models for reasoning about wireless networks: one places n points at random in a region of the plane (typically a square o...