Pages that link to "Item:Q2428670"
From MaRDI portal
The following pages link to Fast algorithms for max independent set (Q2428670):
Displayed 8 items.
- Solving min ones 2-SAT as fast as vertex cover (Q393120) (← links)
- An exact exponential time algorithm for counting bipartite cliques (Q436594) (← links)
- Algorithms for dominating clique problems (Q1758169) (← links)
- Inclusion/exclusion meets measure and conquer (Q2249747) (← links)
- Partition into triangles on bounded degree graphs (Q2392247) (← links)
- Computing the differential of a graph: hardness, approximability and exact algorithms (Q2448922) (← links)
- An Improved Exact Algorithm for Undirected Feedback Vertex Set (Q2867116) (← links)
- Moderately exponential time and fixed parameter approximation algorithms (Q2868915) (← links)