Pages that link to "Item:Q3745299"
From MaRDI portal
The following pages link to An O(2<sup>0.304n</sup>) Algorithm for Solving Maximum Independent Set Problem (Q3745299):
Displaying 16 items.
- Algorithms for four variants of the exact satisfiability problem (Q596105) (← links)
- Strong computational lower bounds via parameterized complexity (Q856413) (← links)
- An efficient fixed-parameter algorithm for 3-hitting set (Q876698) (← links)
- An exact algorithm for maximum independent set in degree-5 graphs (Q896662) (← links)
- Computing branchwidth via efficient triangulations and blocks (Q967315) (← links)
- On comparing algorithms for the maximum clique problem (Q1671301) (← links)
- A refined algorithm for maximum independent set in degree-4 graphs (Q1680494) (← links)
- Faster exact solutions for some NP-hard problems. (Q1853491) (← links)
- Exact algorithms for maximum independent set (Q2013558) (← links)
- A note on the complexity of minimum dominating set (Q2458924) (← links)
- Exact algorithms for maximum weighted independent set on sparse graphs (extended abstract) (Q2695332) (← links)
- On the independent set problem in random graphs (Q2804023) (← links)
- Exponential Time Complexity of Weighted Counting of Independent Sets (Q3058702) (← links)
- Four Shorts Stories on Surprising Algorithmic Uses of Treewidth (Q5042454) (← links)
- On the complexity of \(k\)-SAT (Q5943094) (← links)
- Maximum Weighted Independent Set: Effective Reductions and Fast Algorithms on Sparse Graphs (Q6492080) (← links)
