An Attention-Based Method for the Minimum Vertex Cover Problem on Complex Networks
Solving combinatorial problems on complex networks represents a primary issue which, on a large scale, requires the use of heuristics and approximate algorithms. Recently, neural methods have been proposed in this context to find feasible solutions for relevant computational problems over graphs. Ho...
Kaydedildi:
| Asıl Yazarlar: | , , , |
|---|---|
| Materyal Türü: | Artigo |
| Dil: | Inglês |
| Baskı/Yayın Bilgisi: |
MDPI AG
2024-02-01
|
| Seri Bilgileri: | Algorithms |
| Konular: | |
| Online Erişim: | https://www.mdpi.com/1999-4893/17/2/72 |
| Etiketler: |
Etiket eklenmemiş, İlk siz ekleyin!
|