Crown reductions for the Minimum Weighted Vertex Cover problem

@article{Chlebk2004CrownRF,
  title={Crown reductions for the Minimum Weighted Vertex Cover problem},
  author={Miroslav Chleb{\'i}k and Janka Chleb{\'i}kov{\'a}},
  journal={Discrete Applied Mathematics},
  year={2004},
  volume={156},
  pages={292-312}
}
Conjugated diene homo- or copolymers having chemically bound antioxidant functional groups are prepared by the reaction of polymer-alkali metal with certain antioxidants containing a functional group reactable polymer-alkali metal, providing both coupling and bound anti-oxidant groups. These polymers having antioxidant functional groups chemically attached into the polymer chain have better aging stability than similar polymers containing non-bound antioxidants. 

Citations

Publications citing this paper.
SHOWING 1-10 OF 44 CITATIONS

Graph-Theoretic Concepts in Computer Science

  • Lecture Notes in Computer Science
  • 2016
VIEW 9 EXCERPTS
CITES BACKGROUND & RESULTS
HIGHLY INFLUENCED

Improved upper bounds for vertex cover

  • Theor. Comput. Sci.
  • 2010
VIEW 5 EXCERPTS
CITES BACKGROUND & METHODS
HIGHLY INFLUENCED

Novel approaches for solving large-scale optimization problems on graphs

VIEW 7 EXCERPTS
CITES METHODS & BACKGROUND
HIGHLY INFLUENCED

Harnessing tractability in constraint satisfaction problems

VIEW 3 EXCERPTS
CITES METHODS, BACKGROUND & RESULTS
HIGHLY INFLUENCED

Parameterized Algorithmics: A Graph-Theoretic Approach

VIEW 4 EXCERPTS
CITES BACKGROUND & METHODS
HIGHLY INFLUENCED

References

Publications referenced by this paper.
SHOWING 1-10 OF 34 REFERENCES

Regularizable graphs

C. Berge
  • Advances in graph theory, Ann. Discrete Math. 3
  • 1978
VIEW 4 EXCERPTS
HIGHLY INFLUENTIAL

Blow-ups

M. R. Fellows
  • win/win’s and crown rules: some new directions in FPT, in: Proceedings of the 29th International Workshop on Graph Theoretic Concepts in Computer Science (WG’03), Lecture Notes in Computer Science, vol. 2880
  • 2003
VIEW 4 EXCERPTS
HIGHLY INFLUENTIAL

Parametrized Complexity

R. G. Downey, M. R. Fellows
  • Springer, Berlin
  • 1999
VIEW 3 EXCERPTS
HIGHLY INFLUENTIAL

Fast, effective vertex cover kernelization: a tale of two algorithms

  • The 3rd ACS/IEEE International Conference onComputer Systems and Applications, 2005.
  • 2005
VIEW 1 EXCERPT