Pages that link to "Item:Q3503578"
From MaRDI portal
The following pages link to An O *(1.0977 n ) Exact Algorithm for max independent set in Sparse Graphs (Q3503578):
Displaying 5 items.
- Approximation of max independent set, min vertex cover and related problems by moderately exponential algorithms (Q411835) (← links)
- Faster computation of maximum independent set and parameterized vertex cover for graphs with maximum degree 3 (Q1026228) (← links)
- Fast algorithms for max independent set (Q2428670) (← links)
- Four Shorts Stories on Surprising Algorithmic Uses of Treewidth (Q5042454) (← links)
- Maximum Weighted Independent Set: Effective Reductions and Fast Algorithms on Sparse Graphs (Q6492080) (← links)
