Document is current

Any future updates will be listed below

Correction: Directed capacity-preserving subgraphs: hardness and exact polynomial algorithms

Crossref DOI link: https://doi.org/10.1007/s00236-025-00493-z

Published Online: 2025-07-04

Published Print: 2025-09

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

About CrossMark