Please use this identifier to cite or link to this item: doi:10.22028/D291-38497
Volltext verfügbar? / Dokumentlieferung
Title: Erratum to : Incremental algorithms for the maximum internal spanning tree problem
Author(s): Zhu, Xianbin
Li, Wenjun
Yang, Yongjie
Wang, Jianxin
Language: English
Publisher/Platform: Springer Nature
Year of Publication: 2022
DDC notations: 330 Economics
Publikation type: Other
Abstract: In the original paper [1], there are two errors on page 5. The rules in the algorithm are not sufficient since we omitted one rule during publication. The following rule should be added to the paper. Rule 3: If P1 = (u, v) and P2 = (x, y) are two maximal leaf-paths both with two vertices in T, where u and x are leaves in T and (v, y) ∈ E(G), we remove (y′, y) and then add (v, y) to T where y′ is the non-leaf neighbor of y in T. The expression of Algorithm 2 is not accurate. It should be modified as follows. Line 3: Exhaustively apply Rules 1–3, and for i ∈ {2, 3} only apply Rule i when none of Rules j where 1 ⩽ j < i is applicable. Line 8: Determine the longest path P among all paths whose endpoints have nonempty neighbors in T \ V(T′).
DOI of the first publication: 10.1007/s11432-022-3525-7
URL of the first publication:
Link to this record: urn:nbn:de:bsz:291--ds-384974
Date of registration: 9-Dec-2022
Faculty: HW - Fakultät für Empirische Humanwissenschaften und Wirtschaftswissenschaft
Department: HW - Wirtschaftswissenschaft
Professorship: HW - Keiner Professur zugeordnet
Collections:SciDok - Der Wissenschaftsserver der Universität des Saarlandes

Files for this record:
There are no files associated with this item.

Items in SciDok are protected by copyright, with all rights reserved, unless otherwise indicated.