The following pages link to (Q4471338):
Displaying 8 items.
- An SDP primal-dual algorithm for approximating the Lovász-theta function (Q2249741) (← links)
- On the rational polytopes with Chvátal rank 1 (Q2288183) (← links)
- A subexponential-time algorithm for the maximum independent set problem in \(P_t\)-free graphs (Q2403797) (← links)
- Complementation in T-perfect graphs (Q2672429) (← links)
- Claw-free \(t\)-perfect graphs can be recognized in polynomial time (Q2804992) (← links)
- Distributed Approximate Maximum Matching in the CONGEST Model. (Q5090895) (← links)
- $t$-Perfection in $P_5$-Free Graphs (Q5348215) (← links)
- Distributed approximation for \(f\)-matching (Q6614001) (← links)