Document is current

Any future updates will be listed below

Modified linear programming and class 0 bounds for graph pebbling

Crossref DOI link: https://doi.org/10.1007/s10878-016-0060-6

Published Online: 2016-07-20

Published Print: 2017-07

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

About CrossMark