https://github.com/quancs/eavc

EAVC is an approximate solver for the minimum vertex cover problem inheriting the framework of FastVC
https://github.com/quancs/eavc

Last synced: 11 days ago
JSON representation

EAVC is an approximate solver for the minimum vertex cover problem inheriting the framework of FastVC

• Host: GitHub
• URL: https://github.com/quancs/eavc
• Owner: quancs
• Created: 2019-06-29T02:44:01.000Z (over 5 years ago)
• Default Branch: master
• Last Pushed: 2021-12-09T09:57:06.000Z (about 3 years ago)
• Last Synced: 2024-10-28T04:47:50.230Z (about 2 months ago)
• Language: C++
• Homepage:
• Size: 13.7 KB
• Stars: 3
• Watchers: 1
• Forks: 0
• Open Issues: 0
• Metadata Files:
  • Readme: README.md

Awesome Lists containing this project

README

        
# Introduction

EAVC is a minimum vertex cover problem solver

# Citation

If you feel our work helpful, please cite:

```

@article{quan_local_2021,

	title = {A local search method based on edge age strategy for minimum vertex cover problem in massive graphs},

	volume = {182},

	doi = {10.1016/j.eswa.2021.115185},

	journal = {Expert Systems with Applications},

	author = {Quan, Changsheng and Guo, Ping},

	month = nov,

	year = {2021},

	pages = {115185},

}

```