Get 20M+ Full-Text Papers For Less Than $1.50/day. Start a 14-Day Trial for You or Your Team.

Learn More →

Towards faster local search for minimum weight vertex cover on massive graphs

Towards faster local search for minimum weight vertex cover on massive graphs http://www.deepdyve.com/assets/images/DeepDyve-Logo-lg.png Information Sciences CrossRef

Towards faster local search for minimum weight vertex cover on massive graphs

Information Sciences , Volume 471: 64-79 – Jan 1, 2019
Loading next page...
 
/lp/crossref/towards-faster-local-search-for-minimum-weight-vertex-cover-on-massive-FpgH0XtIcQ

References

References for this paper are not available at this time. We will be adding them shortly, thank you for your patience.

Publisher
CrossRef
Copyright
© 2018 Elsevier Inc. All rights reserved.
ISSN
0020-0255
DOI
10.1016/j.ins.2018.08.052
Publisher site
See Article on Publisher Site

Abstract

Journal

Information SciencesCrossRef

Published: Jan 1, 2019

References