Radosław Ziemann, "A Linear Algorithm for Connected Domination in Partial k-Trees," WSEAS Transactions on Mathematics, vol. 18, pp. 237-240, 2019, DOI:
Radosław Ziemann. A Linear Algorithm for Connected Domination in Partial k-Trees.
WSEAS Transactions on Mathematics. 2019;18:237-240.
WSEAS Transactions on Mathematics
Print ISSN: 1109-2769, E-ISSN: 2224-2880
Volume 18, 2019
A Linear Algorithm for Connected Domination in Partial k-Trees
Author:
Abstract: In this paper we claim that the Corollary 2 in [V. Pinciu, Dominating sets for outerplanar graphs, WSEAS Transactions on Mathematics 1(3), 2004, pp. 55–58] is false. In particular, we present a linear-time algorithm for partial k-trees that solves the problem.
Pages: 237-240 WSEAS Transactions on Mathematics, ISSN / E-ISSN: 1109-2769 / 2224-2880, Volume 18, 2019, Art. #32 DOI: *As the DOI is a unique identifier, it is already available in the pdf version.
**The DOI link will be activated in the first midst of January 2026.
×
Citation Tools