Pages that link to "Item:Q2013558"
From MaRDI portal
The following pages link to Exact algorithms for maximum independent set (Q2013558):
Displayed 25 items.
- Moderately exponential time algorithms for the maximum bounded-degree-1 set problem (Q1627852) (← links)
- On comparing algorithms for the maximum clique problem (Q1671301) (← links)
- \textit{Branch} \& \textit{Memorize} exact algorithms for sequencing problems: efficient embedding of memorization into search trees (Q2027052) (← 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)
- Moderate exponential-time algorithms for scheduling problems (Q2095519) (← links)
- Domination chain: characterisation, classical complexity, parameterised complexity and approximability (Q2181241) (← links)
- On the complexity of detecting hazards (Q2203575) (← links)
- A note on the independence number, domination number and related parameters of random binary search trees and random recursive trees (Q2223687) (← links)
- Exact algorithms for maximum induced matching (Q2407101) (← links)
- Reinforcement learning for combinatorial optimization: a survey (Q2669503) (← links)
- Exact algorithms for maximum weighted independent set on sparse graphs (extended abstract) (Q2695332) (← links)
- Solving vertex cover in polynomial time on hyperbolic random graphs (Q2701066) (← links)
- Four Shorts Stories on Surprising Algorithmic Uses of Treewidth (Q5042454) (← links)
- (Q5092393) (← links)
- Exact Solution Algorithms for the Chordless Cycle Problem (Q5106395) (← links)
- Conflict free version of covering problems on graphs: classical and parameterized (Q5918906) (← links)
- An efficient local search algorithm with large neighborhoods for the maximum weighted independent set problem† (Q6066584) (← links)
- Efficiently approximating vertex cover on scale-free networks with underlying hyperbolic geometry (Q6066757) (← links)
- Further improvements for SAT in terms of formula length (Q6077846) (← links)
- Exact and parameterized algorithms for restricted subset feedback vertex set in chordal graphs (Q6111961) (← links)
- Exact algorithms for restricted subset feedback vertex set in chordal and split graphs (Q6140360) (← links)
- Average-case complexity of a branch-and-bound algorithm for \textsc{Min Dominating Set} (Q6145803) (← links)
- On the maximal independence polynomial of the covering graph of the hypercube up to \(n=6\) (Q6148098) (← links)
- Minimum number of maximal dissociation sets in trees (Q6193972) (← links)