𝔖 Bobbio Scriptorium
✦   LIBER   ✦

A graph approximation heuristic for the vertex cover problem on planar graphs

✍ Scribed by D.L. Meek; R. Gary Parker

Publisher
Elsevier Science
Year
1994
Tongue
English
Weight
684 KB
Volume
72
Category
Article
ISSN
0377-2217

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

On the linear vertex-arboricity of a pla
On the linear vertex-arboricity of a planar graph
✍ K. S. Poh πŸ“‚ Article πŸ“… 1990 πŸ› John Wiley and Sons 🌐 English βš– 153 KB πŸ‘ 2 views

## Abstract We prove in this note that the linear vertex‐arboricity of any planar graph is at most three, which confirms a conjecture due to Broere and Mynhardt, and others.

A linear-time algorithm for the weighted
A linear-time algorithm for the weighted feedback vertex problem on interval graphs
✍ Chin Lung Lu; Chuan Yi Tang πŸ“‚ Article πŸ“… 1997 πŸ› Elsevier Science 🌐 English βš– 459 KB

We present a linear-time algorithm for finding a minimum weighted feedback vertex set on interval graphs using the dynamic programming technique. Since the weighted feedback vertex problem, the weighted C3.1 problem, the maximum weighted 2-colorable subgraph problem and the maximum weighted 2-indepe