The following pages link to Clique Cover and Graph Separation (Q2943572):
Displaying 10 items.
- Parameterized complexity dichotomy for \textsc{Steiner Multicut} (Q295637) (← links)
- On the kernel size of clique cover reductions for random intersection graphs (Q491163) (← links)
- Calculating approximation guarantees for partial set cover of pairs (Q1676481) (← links)
- On some FPT problems without polynomial Turing compressions (Q2072079) (← links)
- Computation and algorithm for the minimum \(k\)-edge-connectivity of graphs (Q2082190) (← links)
- Pairs Covered by a Sequence of Sets (Q2947882) (← links)
- Known Algorithms for Edge Clique Cover are Probably Optimal (Q3464061) (← links)
- Fractals for Kernelization Lower Bounds (Q4609787) (← links)
- Quick separation in chordal and split graphs (Q5089243) (← links)
- Approximate Turing Kernelization for Problems Parameterized by Treewidth (Q5874531) (← links)