554 search results - page 4 / 111 » Power Domination Problem in Graphs |
72
Voted
COCOA
2008
Springer
14 years 11 months ago
2008
Springer
Abstract: Recently, there have been significant theoretical progresses towards fixed-parameter algorithms for the DOMINATING SET problem of planar graphs. It is known that the prob...
JCO
2008
14 years 9 months ago
2008
Minimum m-connected k-dominating set problem is as follows: Given a graph G = (V,E) and two natural numbers m and k, find a subset S V of minimal size such that every vertex in V ...
SODA
2001
ACM
14 years 11 months ago
2001
ACM
CORR
2010
Springer
14 years 6 months ago
2010
Springer
80
Voted
AMAI
2004
Springer
15 years 2 months ago
2004
Springer
In this paper the use of graph isomorphism is investigated within the framework of symmetry breaking in constraint satisfaction problems. A running example of Comma-free codes is ...