k-independent dominating set
Fast self-stabilizing k-independent dominating set construction
... a k-independent dominating set, named F ...+ k rounds, where n is the network size. F ID requires (k + 1)log(n + 1) bits per ...
11
Fast Algorithms for min independent dominating set
... min independent dominating set with running time O ∗ (2 ...minimum independent dominating set on any graph with running time O ∗ (2 ...pendent dominating set within ...
10
On the complexity of Independent Dominating Set with Obligations in graphs
... an independent set of the graph G = (V, ...PIDO dominating at least 2p|V | − 1 vertices that can be constructed by the greedy polynomial algorithm described ...
23
Memory Efficient Self-Stabilizing k-Independent Dominating Set Construction
... In this section, we prove that all maximal computations of protocol SID under any unfair distributed scheduler are finite by reductio ad absurdam arguments. Let e be a maximal computation starting from a configuration, ...
17
Extension of Vertex Cover and Independent Set in Some Classes of Graphs
... degree (by providing a branching algorithm) also apply to graph classes that are closed under taking induced subgraphs and that guarantee the existence of vertices of small degree. Let us exemplify this observation with ...
21
Exact Algorithms for Dominating Clique Problems
... particular, dominating clique problems are polynomial if ∆ is finite and subexponential if ∆ = ...max dominating clique by adding to the graph instance G a new vertex adjacent to any vertex in G, and max ...
13
Dominating sets reconfiguration under token sliding
... size k, with k ∈ [2, n − 1]. Any dominating set of that size necessarily contains the central ...like independent set, there can be no question of superposing two tokens, as two ...
18
The Max Quasi-Independent Set Problem
... of average degree 3 or less from Proposition 4. In our analysis, we use the following result, established by Reed in (B. Reed. Paths, stars and the number three. Combinatorial Probabilistic Computing, 5: 277-295, 1996): ...
21
A relation between the approximated versions of minimum set covering, minimum vertex covering and maximum independent set
... these instances of SC the degrees of the C-vertices are equal to 2. Hence we can treat every instance of VC as an instance of SC, by considering G or equivalently B G as the characteristic graph of this instance. ...
12
Top-k web services compositions: A fuzzy-set-based approach
... Services of the same class S j have the same functionality, they only differ in terms of constraints, providing thus dif- ferent matching degrees. Individual matching degrees of ser- vices could be aggregated. One method ...
7
On the set of imputations induced by the k-additive core
... of k-additive core, that is, the set of k-additive games which dominate a given game, where a k-additive game has its M¨obius transform (or Harsanyi dividends) vanishing for subsets of more ...
15
Improved FPT algorithms for weighted independent set in bull-free graphs
... It is tempting to try to apply similar techniques for obtaining FPT algorithms for other (NP-hard) problems in bull-free graphs. The Independent Feedback Vertex Set problem may be a natural candidate. ...
15
Polyhedra Associated with Open Locating-Dominating and Locating Total-Dominating Sets in Graphs
... Keywords: open locating-dominating code problem, locating total-dominating code problem, polyhedral approach 1 Introduction For a graph G that models a facility, detection devices can be placed at its nodes ...
14
Brief Announcement: Anonymous Obstruction-free (n, k)-Set Agreement with n−k+1 Atomic Read/Write Registers
... (n, k)-set agree- ment problem in an asynchronous anonymous read/write system using solely (n − k + 1) ...(n, k)-set agreement, and (ii) an x-obstruction- free solution using (n − ...
3
K-set agreement bounds in round-based models through combinatorial topology
... Beyond these first forays, many other results got proved through combinatorial topology. Among others, we can cite the lower bounds for renaming by Castañeda and Rajsbaum [7] and the derivation of lower-bounds for ...
11
The identifying code, the locating-dominating, the open locating-dominating and the locating total-dominating problems under some graph operations
... The problems of determining minimum identifying, locating-dominating, open locating-dominating or locating total-dominating codes in a graph G are variations of the classical minimum ...
13
Solving k-Set Agreement Using Failure Detectors in Unknown Dynamic Networks
... fixed set of processes commu- nicating in synchronous rounds, and propose algorithms solving consensus, simultaneous consensus (all processes decide within the same round), and ∆-coordinated consen- sus (all ...
17
Convexity of the Set of k-Admissible Functions on a Compact Kähler Manifold.
... (3) is concave. The method used here to prove the Corollary 1.3, gives for B = I a different approach from the proof of [3] and the elementary proof of [6, p. 51] and [8]. As an immediate consequence of Theorem 2, we get ...
8
K-set agreement bounds in round-based models through combinatorial topology
... Finally, since the minimum dominating set has at most 𝛾 (𝐺) distinct values, at most 𝛾 (𝐺) values are decided, and thus our algo- rithm solves 𝛾 (𝐺)-set agreement. From Castañeda et al. [6, Thm ...
12
A 14$k$-Kernel for Planar Feedback Vertex Set via Region Decomposition
... Vertex Set, Bodlaender and Penninkx [4] gave an algorithm which outputs a kernel of size at most ...Edge Dominating Set, and Triangle Packing in planar graphs improving previous results of Guo and ...
23