Pages that link to "Item:Q2428670"
From MaRDI portal
The following pages link to Fast algorithms for max independent set (Q2428670):
Displayed 26 items.
- MP or not MP: that is the question (Q283264) (← links)
- On bipartization of cubic graphs by removal of an independent set (Q298966) (← links)
- Solving min ones 2-SAT as fast as vertex cover (Q393120) (← links)
- An exact exponential time algorithm for counting bipartite cliques (Q436594) (← links)
- Solving maximum clique in sparse graphs: an \({O(nm+n2^{d/4})}\) algorithm for \(d\)-degenerate graphs (Q479213) (← links)
- An exact algorithm for maximum independent set in degree-5 graphs (Q896662) (← links)
- Branch-and-reduce exponential/FPT algorithms in practice: a case study of vertex cover (Q897878) (← links)
- A refined algorithm for maximum independent set in degree-4 graphs (Q1680494) (← links)
- Exact and superpolynomial approximation algorithms for the \textsc{densest \textit{K}-subgraph} problem (Q1683124) (← links)
- Algorithms for dominating clique problems (Q1758169) (← links)
- Exact algorithms for maximum independent set (Q2013558) (← links)
- A note on the fine-grained complexity of MIS on regular graphs (Q2032165) (← links)
- Exact algorithms for counting 3-colorings of graphs (Q2081467) (← links)
- Inclusion/exclusion meets measure and conquer (Q2249747) (← links)
- An improved exact algorithm for undirected feedback vertex set (Q2355979) (← links)
- Partition into triangles on bounded degree graphs (Q2392247) (← links)
- Finding near-optimal independent sets at scale (Q2401330) (← links)
- Computing the differential of a graph: hardness, approximability and exact algorithms (Q2448922) (← links)
- Exact algorithms for maximum weighted independent set on sparse graphs (extended abstract) (Q2695332) (← links)
- On the Power of Simple Reductions for the Maximum Independent Set Problem (Q2817877) (← links)
- An Improved Exact Algorithm for Undirected Feedback Vertex Set (Q2867116) (← links)
- Moderately exponential time and fixed parameter approximation algorithms (Q2868915) (← links)
- Large Induced Subgraphs via Triangulations and CMSO (Q2954371) (← links)
- Moderately Exponential Approximation: Bridging the Gap Between Exact Computation and Polynomial Approximation (Q4596147) (← links)
- Four Shorts Stories on Surprising Algorithmic Uses of Treewidth (Q5042454) (← links)
- An efficient local search algorithm with large neighborhoods for the maximum weighted independent set problem† (Q6066584) (← links)