Pages that link to "Item:Q3569879"
From MaRDI portal
The following pages link to A Bottom-Up Method and Fast Algorithms for max independent set (Q3569879):
Displaying 10 items.
- Approximation of max independent set, min vertex cover and related problems by moderately exponential algorithms (Q411835) (← links)
- Exact algorithms for dominating set (Q411862) (← links)
- Fast algorithms for max independent set (Q2428670) (← links)
- Sharp separation and applications to exact and parameterized algorithms (Q2429363) (← links)
- Exact Algorithms for Maximum Independent Set (Q2872097) (← links)
- A fine-grained analysis of a simple independent set algorithm (Q2920136) (← links)
- Exponential Time Complexity of Weighted Counting of Independent Sets (Q3058702) (← links)
- Moderately Exponential Approximation: Bridging the Gap Between Exact Computation and Polynomial Approximation (Q4596147) (← links)
- Fully dynamic maximal independent set with sublinear update time (Q5230340) (← links)
- Fully Dynamic Maximal Independent Set with Sublinear in <i>n</i> Update Time (Q5236302) (← links)