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

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".

Authors

Institutions

Publication Details

Journal
Acta Informatica
Published
2025-07-04
DOI
https://doi.org/10.1007/s00236-025-00493-z
Primary Topic
Complexity and Algorithms in Graphs
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

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

Max Ilsen, Markus Chimani
1 links
Acta Informatica
Complexity and Algorithms in Graphs
article

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

Max Ilsen, Markus Chimani
article en

Abstract

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".

Acta InformaticaVol. 62(3)
Osnabrück University (DE)
Openalex Percentile: Top 82%
Complexity and Algorithms in Graphs
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.