The complexity of connected dominating sets and total dominating sets with specified induced subgraphs

descriptionPublicationkeyboard_double_arrow_right Article 01 Dec 2012 English Publisher:Elsevier BVJournal:Information Processing Letters, volume 112, pages 953-957 (issn: 0020-0190,

Copyright policy )

Authors: Oliver Schaudt; Rainer Schrader;

doi: 10.1016/j.ipl.2012.09.002

The complexity of connected dominating sets and total dominating sets with specified induced subgraphs

- Summary
- Subjects
- Metrics

Abstract

zbMATH Open Web Interface contents unavailable due to conflicting licenses.

Related Organizations

University of Cologne
Germany

Keywords

connected domination, Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.), computational complexity, dominating subgraphs, combinatorial problems, Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.), total domination

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).	12
	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.	Top 10%
	influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).	Top 10%
	impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.	Top 10%