A PARALLEL ALGORITHM FOR THE MINIMUM WEIGHTED VERTEX COVER PROBLEM

Authors
LIKAS A STAFYLOPATIS A
Citation
A. Likas et A. Stafylopatis, A PARALLEL ALGORITHM FOR THE MINIMUM WEIGHTED VERTEX COVER PROBLEM, Information processing letters, 53(4), 1995, pp. 229-234
Citations number
10
Categorie Soggetti
Information Science & Library Science","Computer Science Information Systems
Journal title
Information processing letters → ACNP
ISSN journal
00200190
Volume
53
Issue
4
Year of publication
1995
Pages
229 - 234
Database
ISI
SICI code
0020-0190(1995)53:4<229:APAFTM>2.0.ZU;2-5
Abstract
An original parallel algorithm is presented that stems from a suitable physical metaphor by considering each edge of the graph as a cell tha t is attracted by the corresponding vertices and finally moves towards the one of them that wins the competition.