Skip to content
/ EAVC Public

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

Notifications You must be signed in to change notification settings

quancs/EAVC

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

6 Commits
 
 
 
 
 
 
 
 
 
 

Repository files navigation

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},
}

About

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

Resources

Stars

Watchers

Forks

Releases

No releases published

Packages

No packages published