A linear algorithm for connected domination in partial k-trees

Name: A linear algorithm for connected domination in partial k-trees
Keywords: connected domination, algorithm, linear-time, partial k-trees

descriptionPublicationkeyboard_double_arrow_right Article 01 Jan 2019 English Journal:WSEAS Transactions on Mathematics, volume 18, pages 237-240 (issn: 1109-2769,

A linear algorithm for connected domination in partial k-trees

- Summary
- Subjects
- Metrics

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 forpartial k-trees that solves the problem.

Related Organizations

University of Gdańsk
Poland

Keywords

connected domination, algorithm, linear-time, partial k-trees

Impact byBIP!

	selected citations These citations are derived from selected sources. This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).	0
	popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.	Average
	influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).	Average
	impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.	Average

Found an issue? Give us feedback

Average

gold