k-independentA subset of vertices of a graph G is k-independent if it induces in G a subgraph of maximum degree less than k. The minimum and maximum cardinalities of a maximal k-independent set are respectively denoted ik(G) and ik(G). We give some relations between ik(G) and j (G...
A simple parallel randomized algorithm to find a maximal independent set in a graph G = ( V, E) on n vertices is presented. Its expected running time on a concurrent-read concurrent-write PRAM with O(| E| d max) processors is O(log n), where d max denotes the maximum degree. On ...
I think I solved maximal independent set problem which was called NP hard problem. My Solution works in O(log(n)*n*sqrt(n))) Time and alot of memory.I think I have created some of the new techniques, during solving the problem. Solution is quite big, and it may not be clear, beca...
The relation between the size mis(G) of a maximum independent set and the size cds(G) of a minimum connected dominating set in the same graph G plays an important role in establishing the performance ratio of those approximation algorithms. Previously, it is known that mis(G)⩽4·cds(G...
A connected dominating set (CDS) for a graph G(V,E) is a subset V1 of V, such that each node in V--V1 is adjacent to some node in V1, and V1 induces a conn... KM Alzoubi,PJ Wan,O Frieder - Acm Interational Symposium on Mobile Ad Hoc Networking & Computing 被引量: 686发...
Maximal and Maximum Independent Sets in Graphs A maximal independent set of a graph G is an independent set which is not contained properly in any other independent set of G. An independent set is called maximum if it is of largest cardinality. Denote i(G) to be the number of maximal.....
maximal independent set (redirected fromMaximal clique) maximal independent set [¦mak·sə·məl ‚in·də‚pen·dənt ′set] (mathematics) An independent set of vertices of a graph which is not a proper subset of another independent set. ...
A faster algorithm for finding a maximum independent set in a graph is presented. The algorithm is an improved version of the one by Tarjan and Trojanowski... J Tang - 《Computers IEEE Transactions on》 被引量: 163发表: 1986年 Faster computation of maximum independent set and parameterized ...
We also show that there is no polynomial-delay algorithm for generating all maximal independent sets in reverse lexicographic order, unless P=NP.关键词: Theoretical or Mathematical/ computational complexity graph theory set theory/ NP complete computational complexity maximal independent sets graph ...
本文目的:解说并行Finding a Maximal Independent Set(寻找最大独立集问题)算法,以及在Hama平台上怎样实现该算法。该算法可方便移植到全部的Pregel-Like系统中,如Giraph、GPS (Graph Processing System)。 前言:关于Maximal Independent Set(MIS)的基础知识參考我的博客《找最大独立集问题-Finding a Maximal Independent ...