Independent Set
Constructing MICDS Algorithm for Data Transmission using Maximal Independent Set in Network Graph
... maximal independent set of the network graph. Using maximal independent sets, the dominating set and connectors for the dominating set in the network graph is find ...dominating ...
6
Solving the independent set problem by sticker based DNA computers
... DNA computing was initially developed by Leonard Adleman in 1994 [1]. Adleman resolved an instance of Hamiltonian path problem just by handling the DNA mo- lecules. In 1995, Lipton [3] presented a method for solv- ing ...
6
An output sensitive algorithm for computing a maximum independent set of a circle graph
... This paper has described a O ( n min {d, α} ) time and O ( n ) space algorithm for computing a maximum independent set of an unweighted circle graph. Future work could attempt to extend coverage to weighted ...
13
Heuristic Algorithm for Graph Coloring Based On Maximum Independent Set
... ABSTRACT: A number of heuristic algorithms have been developed for the graph coloring problem, but unfortunately, on any given instance, they may produce colorings that are very far from optimal. In this paper we ...
10
A visual tool for determining the maximum independent set of a graph using the polynomial formulation method
... maximum independent set of a graph G has been extensively studied [1], and there is a number of works on counting the number of maximum independent sets ...maximal independent sets for a ...
8
The Study on the (L,M) Fuzzy Independent Set Systems
... fuzzy set system and independent fuzzy set system to L-fuzzy setting are ...defined. Independent M-fuzzifying set system is introduced and obtained its some ...of independent ...
8
Inapproximability of Vertex Cover and Independent Set in Bounded Degree Graphs
... and Independent Set are two of the most well-studied NP-complete ...an independent set of a graph is a set of vertices no two of which are connected by an edge, and that a vertex cover ...
17
On the Maximalization of the witness sets in Independent Set readings
... This paper compared the two kind of Maximalization proposed in the literature for handling the proper truth values of Independent Set readings. They have been termed as Local and Global Maximalization. The ...
10
Deletion of an Edge in Majority Independent Set of a Graph
... Claude Berge in 1980, introduced B graphs. These are graphs in which every vertex in the graph is contained in a maximum independent set of the graph. Fircke.et.al [1] in 2002 made a beginning of the study ...
15
Local Interference Exchange Based Maximum Weighted Independent Set Algorithm for D2D Communication in Cellular Network
... a D2D link as the sum of the interference from its neighbors. In dense-deployed D2D network, D2D links with strong interference to or from each other may not transmit at the same time. Accessing the D2D link with more ...
11
Structural solutions to maximum independent set and related problems
... One approach to deal with NP-hard problems is based on the notion of xed-parameter tractability (fpt), which is a relaxation of classical polynomial-time solvability. A param- eterized problem is said to be xed-parameter ...
154
A polynomial turing-Kernel for weighted independent set in bull-free graphs
... By the last item all moves from S to R are necessary. This is why the algo- rithm reports a failure if some vertex of R has mark ε. If the process does not stop for that particular reason, then all vertices of R have ...
20
Support Independence in Graphs
... In any graph G, the support of a vertex is defined as the sum of degrees of its neighbours. A graph G is said to be balanced, if every vertex of G has same support. G is called highly unbalanced when no two vertices of G ...
10
A Distributed Approach for Frequency allocation using Graph Coloring in Mobile Networks
... The proposed technique explores a general framework for studying distributed frequency allocation in mobile cellular network. The problem can be abstracted as a multicoloring problem on a cellular graph. This paper ...
5
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
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 ...
12
Coarsening invariance and bucket-sorted independent sets for algebraic multigrid
... of independent set-based coarsening algorithms in ...of independent set-based coarse- grid selection, given restrictions on the selection ...considered independent of the computational ...
19
The Split Majority Domination Number of a Graph
... vertex set D ’ properly containing D is not majority independent then D is called maximal majority independent ...majority independent set is called majority independence number and it ...
10
Comparisons of seven algorithms for pathway analysis using the WTCCC Crohn's Disease dataset
... Among the other five selected algorithms, only Aliga- tor takes SNP-level summary statistics as input as GATES-Simes and GATES-Hyper does; for Aligator, a gene is treated as significant if it contains at least one SNP ...
9
Player splitting, players merging, the Shapley set value and the Harsanyi set value
... But often, the weights can depend on the coalition functions as handled in some prob- lems of profit distribution (earnings per share) or cost allocation (see e. g. Moriarity (1975)). If, for example, the weights are the ...
25