Iterative improvement of vertex covers
β Scribed by Youssef Saab
- Publisher
- Elsevier Science
- Year
- 1995
- Tongue
- English
- Weight
- 300 KB
- Volume
- 55
- Category
- Article
- ISSN
- 0020-0190
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
Recently, there has been increasing interest and progress in lowering the worstcase time complexity for well-known NP-hard problems, particularly for the Vertex Cover problem. In this paper, new properties for the Vertex Cover problem are indicated, and several simple and new techniques are introduc
The Guyan method to reduce stiffness and mass matrices of linear structures is widely used in engineering practice. However, it introduces errors in the reduced mass matrix, and the eigensolutions based on this matrix are reliable only for the lowest modes. Additionally a certain skill is required t
## Abstract We provide for the first time, a complete list of forbidden minors (obstructions) for the family of graphs with vertex cover 6. This study shows how to limit both the search space of graphs and improve the efficiency of an obstruction checking algorithm when restricted to __k__βVERTEX C