[HTML][HTML] The many facets of upper domination
The many facets of upper domination - ScienceDirect Skip to main contentSkip to article
Elsevier logo Journals & Books Search RegisterSign in View PDF Download full issue …
Elsevier logo Journals & Books Search RegisterSign in View PDF Download full issue …
[HTML][HTML] Fast algorithms for min independent dominating set
N Bourgeois, F Della Croce, B Escoffier… - Discrete Applied …, 2013 - Elsevier
We first devise a branching algorithm that computes a minimum independent dominating set
with running time O∗(1.3351 n)= O∗(20.417 n) and polynomial space. This improves upon …
with running time O∗(1.3351 n)= O∗(20.417 n) and polynomial space. This improves upon …
A path forming method for water surface mobile sink using Voronoi diagram and dominating set
N Xia, C Wang, Y Yu, H Du, C Xu… - IEEE Transactions on …, 2018 - ieeexplore.ieee.org
The sensors in water surface sensor networks are sparsely deployed, which means the
distance between sensors is generally larger than the sensors' communication radius. So, it …
distance between sensors is generally larger than the sensors' communication radius. So, it …
[图书][B] Exact exponential-time algorithms for domination problems in graphs
JMM van Rooij - 2011 - researchgate.net
What lies before you is the result of a four year period of PhD research. It is the product of
creative ideas, hard labour, and many discussions and collaborations with other researchers …
creative ideas, hard labour, and many discussions and collaborations with other researchers …
Inclusion/exclusion meets measure and conquer
Inclusion/exclusion and measure and conquer are two central techniques from the field of
exact exponential-time algorithms that recently received a lot of attention. In this paper, we …
exact exponential-time algorithms that recently received a lot of attention. In this paper, we …
Upper domination: complexity and approximation
Abstract We consider Upper Domination, the problem of finding a maximum cardinality
minimal dominating set in a graph. We show that this problem does not admit an n^ 1-ϵ …
minimal dominating set in a graph. We show that this problem does not admit an n^ 1-ϵ …
Some observations on algorithms for computing minimum independent dominating set
A Potluri, A Negi - … Computing: 4th International Conference, IC3 2011 …, 2011 - Springer
In this paper, we present some observations on the various algorithms proposed to find a
Minimum Independent Dominating Set (MIDS). MIDS is proven to be an NP-hard problem …
Minimum Independent Dominating Set (MIDS). MIDS is proven to be an NP-hard problem …
[图书][B] Optimization Theory, Decision Making, and Operations Research Applications: Proceedings of the 1st International Symposium and 10th Balkan Conference on …
These proceedings consist of 30 selected research papers based on results presented at
the 10th Balkan Conference & 1st International Symposium on Operational Research …
the 10th Balkan Conference & 1st International Symposium on Operational Research …
A branch-and-reduce algorithm for finding a minimum independent dominating set
S Gaspers, M Liedloff - Discrete Mathematics & Theoretical …, 2012 - dmtcs.episciences.org
A Branch-and-Reduce Algorithm for Finding a Minimum Independent Dominating Set Page 1
Discrete Mathematics and Theoretical Computer Science DMTCS vol. 14:1, 2012, 29–42 A …
Discrete Mathematics and Theoretical Computer Science DMTCS vol. 14:1, 2012, 29–42 A …
Solving the Minimum Independent Domination Set Problem in Graphs by Exact Algorithm and Greedy Heuristic∗
C Laforest, R Phan - RAIRO-Operations Research, 2013 - cambridge.org
In this paper we present a new approach to solve the Minimum Independent Dominating Set
problem in general graphs which is one of the hardest optimization problem. We propose a …
problem in general graphs which is one of the hardest optimization problem. We propose a …