106 search results - page 5 / 22 » Dominating direct products of graphs |
STACS
2010
Springer
14 years 2 months ago
2010
Springer
In 2000 Alber et al. [SWAT 2000 ] obtained the ļ¬rst parameterized subexponential algorithm on undirected planar graphs by showing that k-DOMINATING SET is solvable in time 2O( ā...
IPPS
2002
IEEE
14 years 8 days ago
2002
IEEE
This paper addresses the problem of scatternet formation and maintenance for multi-hop Bluetooth based personal area and ad hoc networks with minimal communication overhead. Each ...
STACS
2010
Springer
14 years 2 months ago
2010
Springer
We study computational problems that arise in the context of iterated dominance in anonymous games, and show that deciding whether a game can be solved by means of iterated weak d...
PPOPP
2012
ACM
12 years 2 months ago
2012
ACM
Speedups demonstrated for ļ¬nding the biconnected components of a graph: 9x to 33x on the Explicit Multi-Threading (XMT) many-core computing platform relative to the best serial ...
CORR
2011
Springer
12 years 11 months ago
2011
Springer
Although many algorithms have been designed to construct Bayesian network structures using diļ¬erent approaches and principles, they all employ only two methods: those based on i...