554 search results - page 4 / 111 » Power Domination Problem in Graphs |
COCOA
2008
Springer
13 years 9 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
13 years 7 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
13 years 9 months ago
2001
ACM
CORR
2010
Springer
13 years 4 months ago
2010
Springer
AMAI
2004
Springer
14 years 28 days 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 ...