Document is current

Any future updates will be listed below

Most vital vertices for the shortest s–t path problem: complexity and Branch-and-Cut algorithm

Crossref DOI link: https://doi.org/10.1007/s11590-019-01527-5

Published Online: 2020-01-03

Published Print: 2020-11

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

About CrossMark