Pages that link to "Item:Q5232762"
From MaRDI portal
The following pages link to Exactly Solving the Maximum Weight Independent Set Problem on Large Real-World Graphs (Q5232762):
Displaying 8 items.
- Exact algorithms for maximum weighted independent set on sparse graphs (extended abstract) (Q2695332) (← links)
- Empirical Evaluation of Approximation Algorithms for Generalized Graph Coloring and Uniform Quasi-wideness (Q4984870) (← links)
- A Semi-exact Algorithm for Quickly Computing A Maximum Weight Clique in Large Sparse Graphs (Q5154765) (← links)
- (Q5874530) (← links)
- Maximum Weighted Independent Set: Effective Reductions and Fast Algorithms on Sparse Graphs (Q6492080) (← links)
- Exact and heuristic solution approaches for the generalized independent set problem (Q6551177) (← links)
- Automated category tree construction: hardness bounds and algorithms (Q6572611) (← links)
- A metaheuristic algorithm for large maximum weight independent set problems (Q6663969) (← links)