Correction: Directed capacity-preserving subgraphs: hardness and exact polynomial algorithms (original) (raw)

Correction: Acta Informatica (2025) 62:10

In the original version of this article, Some errors were introduced in the editorial process. In particular P1-graph was incorrectly written as P 1-graph in the text. In “Definition 1” section, citation figure 5 should have been figure 4. Figures 4−6 captions had been interchanged. Fig. 4 caption should have been Fig. 6 and Fig. 5 caption should have been Fig. 4 and Fig. 6 caption should have been Fig. 5 and under the section “MCPS and MCPS1 on laminar series-parallel graphs”, second sentence in the “Proof”, which previously read “We can consider the different MEASs in isolation as their solutions are independent of each other: LSPs are P2graphs” but should have been “We can consider the different MEASs in isolation as their solutions are independent of each other: LSPs are P2-graphs”.

The original article has been corrected.

Author information

Authors and Affiliations

  1. Theoretical Computer Science, Osnabrück University, Osnabrück, Germany
    Markus Chimani & Max Ilsen

Authors

  1. Markus Chimani
  2. Max Ilsen

Corresponding author

Correspondence toMax Ilsen.

Additional information

Publisher’s note

Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.

Rights and permissions

Open Access This article is licensed under a Creative Commons Attribution 4.0 International License, which permits use, sharing, adaptation, distribution and reproduction in any medium or format, as long as you give appropriate credit to the original author(s) and the source, provide a link to the Creative Commons licence, and indicate if changes were made. The images or other third party material in this article are included in the article’s Creative Commons licence, unless indicated otherwise in a credit line to the material. If material is not included in the article’s Creative Commons licence and your intended use is not permitted by statutory regulation or exceeds the permitted use, you will need to obtain permission directly from the copyright holder. To view a copy of this licence, visit http://creativecommons.org/licenses/by/4.0/.

Reprints and permissions

About this article

Cite this article

Chimani, M., Ilsen, M. Correction: Directed capacity-preserving subgraphs: hardness and exact polynomial algorithms.Acta Informatica 62, 27 (2025). https://doi.org/10.1007/s00236-025-00493-z

Download citation