A Parallel Algorithm for the Minimum Weighted Vertex Cover Problem
| dc.contributor.author | Likas, A. | en |
| dc.contributor.author | Stafylopatis, A. | en |
| dc.date.accessioned | 2015-11-24T17:01:47Z | |
| dc.date.available | 2015-11-24T17:01:47Z | |
| dc.identifier.issn | 0020-0190 | - |
| dc.identifier.uri | https://olympias.lib.uoi.gr/jspui/handle/123456789/10978 | |
| dc.rights | Default Licence | - |
| dc.subject | heuristics | en |
| dc.subject | optimization | en |
| dc.subject | parallel algorithms | en |
| dc.subject | vertex covering | en |
| dc.subject | approximation | en |
| dc.title | A Parallel Algorithm for the Minimum Weighted Vertex Cover Problem | 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. | en |
| heal.access | campus | - |
| heal.fullTextAvailability | TRUE | - |
| heal.journalName | Information Processing Letters | en |
| heal.journalType | peer reviewed | - |
| heal.language | en | - |
| heal.publicationDate | 1995 | - |
| heal.recordProvider | Πανεπιστήμιο Ιωαννίνων. Σχολή Θετικών Επιστημών. Τμήμα Μηχανικών Ηλεκτρονικών Υπολογιστών και Πληροφορικής | el |
| heal.type | journalArticle | - |
| heal.type.el | Άρθρο Περιοδικού | el |
| heal.type.en | Journal article | en |
Αρχεία
Φάκελος/Πακέτο αδειών
1 - 1 of 1
Φόρτωση...
- Ονομα:
- license.txt
- Μέγεθος:
- 1.74 KB
- Μορφότυπο:
- Item-specific license agreed upon to submission
- Περιγραφή: