92 search results - page 1 / 19 » Bottleneck Domination and Bottleneck Independent Domination ... |
JISE
2002
13 years 5 months ago
2002
OL
2011
13 years 10 days ago
2011
Given a simple undirected graph, the minimum connected dominating set problem is to find a minimum cardinality subset of vertices D inducing a connected subgraph such that each ve...
IWPEC
2009
Springer
13 years 12 months ago
2009
Springer
Abstract. We introduce the graph parameter boolean-width, related to the number of different unions of neighborhoods across a cut of a graph. For many graph problems this number is...
CORR
2010
Springer
13 years 5 months ago
2010
Springer
A dominating set D of a graph G = (V, E) is a subset of vertices such that every vertex in V \ D has at least one neighbour in D. Moreover if D is an independent set, i.e. no verti...
COLOGNETWENTE
2007
13 years 6 months ago
2007
We present the first polynomial-time approximation scheme (PTAS) for the Minimum Independent Dominating Set problem in graphs of polynomially bounded growth. Graphs of bounded gr...