Iterative improvement of vertex covers

DOI10.1016/0020-0190(95)00058-KMaRDI QIDQ672405zbMATH OpenFDO

Authors Youssef G. Saab

Publication date 28 February 1997

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

zbMATH Keywords

Algorithms

Mathematics Subject Classification ID

Combinatorics on words (68R15) Computing methodologies for text processing; mathematical typography (68U15)

Cites work

• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• An $n^{5/2} $ Algorithm for Maximum Matchings in Bipartite Graphs
• Efficient bounds for the stable set, vertex cover and set packing problems
• Graph theory
• Ramsey numbers and an approximation algorithm for the vertex cover problem
• Vertex packings: Structural properties and algorithms

Cited in

(1)

• Extracting pure network submatrices in linear programs using signed graphs.

This page was built for publication: Iterative improvement of vertex covers

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q672405)