independent sets
Edge Stable Sets and Edge Independent Sets in Hypergraphs
... stable sets& edge independent sets in ...edge independent set is also given by us and some results related to edge independent set in hypergraphs have been ...
7
On ve-quasi and secured ve-quasi independent sets of a graph
... ve-quasi independent sets using the concept of ve-domination in ...ve-quasi independent set if whenever u, v ∈ S are adjacent vertices, there is a vertex x in V (G) \S which m-dominates the edge uv ...
5
Coarsening invariance and bucket-sorted independent sets for algebraic multigrid
... of independent-set based coarse-grid se- ...initialization, independent set selection, and weight update produce the same coarse grids, regardless of the particular implementation of the ...
19
Approximating the Caro Wei bound for independent sets in graph streams
... for independent sets, which shows that n/(d + 1) is a lower bound on the size of a maximum independent set, is also a lower bound on β(G), where d is the average degree of the input ...
13
The Number of Maximal Independent Sets in Quasi Tree Graphs and Quasi Forest Graphs
... maximal independent set is an independent set that is not a proper subset of any other independent ...maximal independent sets among all trees, forests, quasi-trees and ...maximal ...
14
Hadamard Matrices, $d$-Linearly Independent Sets and Correlation-Immune Boolean Functions with Minimum Hamming Weights
... In this paper, we studied the relationships between Hadamard matrices, d- linearly independent sets and correlation-immune Boolean functions with minimum Hamming weights. We proposed two constructions of ...
15
Eternal Independent Sets in Graphs
... total-eternal independent set is the total-eternal independence number of G denoted α ∞ t ...total-eternal independent set problem, the actual sequence of attacks does not matter, since all the guards must ...
12
An Alternative Proof of the Largest Number of Maximal Independent Sets in Connected Graphs Having at Most Two Cycles
... maximal independent sets among all graphs and connected graphs of order n, which contain at most one ...maximal independent sets among all graphs of order n, which contain at most r ...maximal ...
11
From matchings to independent sets
... Clearly, if H is a clique, then the H-reduction coincides with the clique reduction of Lov´ asz and Plummer. Moreover, similarly to the clique reduction, the H-reduction becomes α-perfect whenever the independence number ...
21
MCMC sampling colourings and independent sets of G(n,d/n) near the uniqueness threshold
... For this kind of problems, the most powerful algo- rithms and somehow the most natural ones are based on the Markov Chain Monte Carlo (MCMC) method. The setup is an ergodic, time-reversible Markov chain over the ...
13
Independent sets in vertex arrival streams
... maximal independent set problem, where we need to find a subset of non-adjacent vertices that cannot be ...maximal independent set in vertex arrival streams (both explicit and implicit) using space ˜ ...
15
Independent sets of maximum weight in apple free graphs
... In this paper, we have shown that the maximum weight independent set problem can be solved in polynomial time on apple-free graphs. Our approach is based on a combination of clique separator decomposition and ...
17
Convergence of MCMC and loopy BP in the tree uniqueness region for the hard core model
... The hard-core gas model is a natural combinatorial problem that has played an important role in the design of new approximate counting algorithms and for understanding computational connections to statistical physics ...
54
The number of maximal sum free subsets of integers
... We remark that Lemma 2.4 was already essentially proven in [8] (without applying Lemma 2.3). Note that γ could be negative in Lemma 2.4. The upper bound 1/11 on γ here can be relaxed to any constant smaller than 1/10 ...
11
?-Independent and Dissociate Sets on Compact Commutative Strong Hypergroups
... Dissociate sets are weak versions of independent sets that were introduced in [9] for characters group of a compact abelian group. We generalize this concept for duals of compact hypergroups and give ...
10
Measuring the ICF components of impairment, activity limitation and participation restriction: an item analysis using classical test theory and item response theory
... was no criteria on which to judge which items to retain or delete. These items would violate the assumption of local independence and so were grouped into independent sets (e.g. the four stair items were ...
20
Matroids on domains of functions
... The maximal independent sets are known as bases and their size is the rank of the matroid.. This brings us to the next two axiomatic descriptions.[r] ...
88
k-TUPLE DOMATIC IN GRAPHS
... a coloring f defines a domatic partition of G if and only if for every vertex x ∈ V (G), f (N [x]) = {1, 2, ..., `}. Thus, any graph G satisfies d(G) ≤ δ(G) + 1. The word domatic, an amalgamation of the words domination ...
8
Compression methods for graph algorithms
... Running Time For Original and Modified Algorithms Versus Number of Maximal Independent Sets.. Time per Maximal Independent Set Versus Ratio of Procedure Calls For The Original Algorithm.[r] ...
229
More on vague sets
... fuzzy sets; Fuzzy sets and ...Vague sets are intutionistics fuzzy sets. Fuzzy sets and system 79 ...Fuzzy sets and systems : Theory and Applications, Academic press, New ...Vague ...
6