A fine-grained analysis of a simple independent set algorithm
From MaRDI portal
Publication:2920136
Recommendations
- On the complexity of approximating the independent set problem
- Exact algorithms for maximum independent set
- Exact Algorithms for Maximum Independent Set
- A note on the random greedy independent set algorithm
- On the complexity of approximating the independent set problem (extended abstract)
- A Simple Parallel Algorithm for the Maximal Independent Set Problem
- Probabilistic analysis of a parallel algorithm for finding maximal independent sets
- Publication:4864968
- A bottom-up method and fast algorithms for Max Independent Set
- Algorithms for maximum independent sets
Cited in
(15)- Algorithmic aspects of \textsc{Upper Domination}: a parameterised perspective
- A novel parameterised approximation algorithm for \textsc{minimum vertex cover}
- Exponential Time Complexity of Weighted Counting of Independent Sets
- Four Shorts Stories on Surprising Algorithmic Uses of Treewidth
- Maximum Weighted Independent Set: Effective Reductions and Fast Algorithms on Sparse Graphs
- Fast algorithms for max independent set
- Branch-and-reduce exponential/FPT algorithms in practice: a case study of vertex cover
- The many facets of upper domination
- An exact algorithm for maximum independent set in degree-5 graphs
- Computing the differential of a graph: hardness, approximability and exact algorithms
- On independent sets and bicliques in graphs
- Exact algorithms for maximum weighted independent set on sparse graphs (extended abstract)
- On computing the minimum 3-path vertex cover and dissociation number of graphs
- Exact algorithms for maximum independent set
- A refined algorithm for maximum independent set in degree-4 graphs
This page was built for publication: A fine-grained analysis of a simple independent set algorithm
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2920136)
