Solving the stable set problem in terms of the odd cycle packing number
From MaRDI portal
Recommendations
- Odd cycle packing
- Induced odd cycle packing number, independent sets, and chromatic number
- Stability critical graphs and ranks facets of the stable set polytope
- A polynomial algorithm for maximum weighted vertex packings on graphs without long odd cycles
- Extended formulations for stable set polytopes of graphs without two disjoint odd cycles
Cited in
(10)- FPT-algorithms for some problems related to integer programming
- An FPTAS for the -modular multidimensional knapsack problem
- Extended formulations for stable set polytopes of graphs without two disjoint odd cycles
- On lattice point counting in -modular polyhedra
- QPTAS and subexponential algorithm for maximum clique on disk graphs
- A new contraction technique with applications to congruency-constrained cuts
- Induced odd cycle packing number, independent sets, and chromatic number
- Sparse graphs with bounded induced cycle packing number have logarithmic treewidth
- Faster algorithms for sparse ILP and hypergraph multi-packing/multi-cover problems
- Integer programs with bounded subdeterminants and two nonzeros per row
This page was built for publication: Solving the stable set problem in terms of the odd cycle packing number
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2978512)
