A decomposition strategy for the vertex cover problem

DOI10.1016/0020-0190(89)90091-4zbMath0678.05050OpenAlexW2072913850MaRDI QIDQ1123907

Paola Bertolazzi, Antonio Sassano

Publication date: 1989

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0020-0190(89)90091-4

zbMATH Keywords

decompositionstable setminorclutterminimum weight vertex cover problem

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Related Items (1)

A neural network for the minimum set covering problem

Cites Work

• Unnamed Item
• Unnamed Item
• Characterizations of strongly chordal graphs
• The matroids with the max-flow min-cut property
• Characterizations of totally balanced matrices
• The NP-completeness column: an ongoing guide
• A Class of Polynomially Solvable Set-Covering Problems

This page was built for publication: A decomposition strategy for the vertex cover problem