Independent set (graph theory) - Wikipedia
discrete mathematics - Algorithm to compute maximum independent set of graph with maximum block size k with comlexity $O(f(k)\cdot p(|V(G)|)$ - Mathematics Stack Exchange
Study of greedy algorithm for solving Maximum Independent Set problem
Maximal independent set - Wikipedia
The Independent Set Algorithm
PPT - A graph problem: Maximal Independent Set PowerPoint Presentation - ID:4226002
FiveProblemsSubsCld015.Png
Independent Vertex Sets and Independence Numbers | Graph Theory - YouTube
algorithm - What is the maximum size of an independent set in the following tree? - Stack Overflow
Independent set in discrete mathematics - javatpoint
Using synchronized oscillators to compute the maximum independent set | Nature Communications
Maximum Independent Set in Trees (Linear Time Algorithm) - YouTube
Independent Set - Georgia Tech - Computability, Complexity, Theory: Complexity - YouTube
Maximum Independent Set Problem | Techie Delight
Proof that Independent Set in Graph theory is NP Complete - GeeksforGeeks
![PDF] Scalable kernelization for the maximum independent set problem | Semantic Scholar](https://d3i71xaburhd42.cloudfront.net/c7f7946ff32b3b4768db60086d78562562324598/14-Figure2.1-1.png "PDF] Scalable kernelization for the maximum independent set problem | Semantic Scholar")
PDF] Scalable kernelization for the maximum independent set problem | Semantic Scholar
Domination - 演算法筆記
Maximal independent set - Wikipedia
coarsen.h File Reference
Maximum Independent Set in Bipartite Graphs | Ali Ibrahim Site
1 Maximal Independent Set. 2 Independent Set (IS): In a graph G=(V,E), |V|=n, |E|=m, any set of nodes that are not adjacent. - ppt download
