A parallel algorithm for the minimum weighted vertex cover problem

Likas, A; Stafylopatis, A

dc.contributor.author	Likas, A	en
dc.contributor.author	Stafylopatis, A	en
dc.date.accessioned	2014-03-01T01:10:41Z
dc.date.available	2014-03-01T01:10:41Z
dc.date.issued	1995	en
dc.identifier.issn	0020-0190	en
dc.identifier.uri	https://dspace.lib.ntua.gr/xmlui/handle/123456789/11426
dc.subject	Heuristics	en
dc.subject	Optimization	en
dc.subject	Parallel algorithms	en
dc.subject	Vertex covering	en
dc.subject.classification	Computer Science, Information Systems	en
dc.subject.other	Computational complexity	en
dc.subject.other	Graph theory	en
dc.subject.other	Heuristic methods	en
dc.subject.other	Mathematical models	en
dc.subject.other	Matrix algebra	en
dc.subject.other	Optimization	en
dc.subject.other	Set theory	en
dc.subject.other	Minimum weighted vertex cover problem	en
dc.subject.other	Parallel algorithms	en
dc.title	A parallel algorithm for the minimum weighted vertex cover problem	en
heal.type	journalArticle	en
heal.identifier.primary	10.1016/0020-0190(94)00189-6	en
heal.identifier.secondary	http://dx.doi.org/10.1016/0020-0190(94)00189-6	en
heal.language	English	en
heal.publicationDate	1995	en
heal.abstract	An original parallel algorithm is presented that stems from a suitable physical metaphor by considering each edge of the graph as a cell that is attracted by the corresponding vertices and finally moves towards the one of them that wins the competition. © 1995 Elsevier Science B.V. All rights reserved.	en
heal.publisher	ELSEVIER SCIENCE BV	en
heal.journalName	Information Processing Letters	en
dc.identifier.doi	10.1016/0020-0190(94)00189-6	en
dc.identifier.isi	ISI:A1995QH50900009	en
dc.identifier.volume	53	en
dc.identifier.issue	4	en
dc.identifier.spage	229	en
dc.identifier.epage	234	en