𝔖 Bobbio Scriptorium
✦   LIBER   ✦

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


Vertex Cover: Further Observations and F
✍ Jianer Chen; Iyad A. Kanj; Weijia Jia πŸ“‚ Article πŸ“… 2001 πŸ› Elsevier Science 🌐 English βš– 172 KB

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

Iterative improvement of eigensolutions
✍ Sauer, G. πŸ“‚ Article πŸ“… 1989 πŸ› Wiley (John Wiley & Sons) 🌐 English βš– 337 KB

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

Minor-order obstructions for the graphs
✍ Michael J. Dinneen; Liu Xiong πŸ“‚ Article πŸ“… 2002 πŸ› John Wiley and Sons 🌐 English βš– 240 KB πŸ‘ 1 views

## 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