Document is current

Any future updates will be listed below

A novel algorithm for the vertex cover problem based on minimal elements of discernibility matrix

Crossref DOI link: https://doi.org/10.1007/s13042-019-00933-6

Published Online: 2019-02-07

Published Print: 2019-12

Update policy: https://doi.org/10.1007/springer_crossmark_policy

About CrossMark