231 search results - page 34 / 47 » The Number of Independent Sets in a Regular Graph |
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 ...
STOC
2009
ACM
16 years 9 days ago
2009
ACM
We study integrality gaps for SDP relaxations of constraint satisfaction problems, in the hierarchy of SDPs defined by Lasserre. Schoenebeck [25] recently showed the first integra...
117
click to vote
DM
2002
14 years 11 months ago
2002
A simple characterization of the 3, 4, or 5-colorable Eulerian triangulations of the projective plane is given. Key words: Projective plane, triangulation, coloring, Eulerian grap...