Algorithm and Hardness Results for Outer-connected Dominating Set in Graphs
type: Item
instance of: scholarly article
title: Algorithm and Hardness Results for Outer-connected Dominating Set in Graphs
zbMATH Open document ID: 1305.05179
author: B. S. Panda
author: Arti Pandey
published in: Journal of Graph Algorithms and Applications
publication date: 2015-01-15T00:00:00Z
Mathematics Subject Classification ID: 05C69
Mathematics Subject Classification ID: 05C40
Mathematics Subject Classification ID: 05C85
Mathematics Subject Classification ID: 68Q17
Mathematics Subject Classification ID: 68W25
zbMATH DE Number: 6386933
zbMATH Keywords: minimum outer-connected domination problem
zbMATH Keywords: outer-connected domination decision problem
MaRDI profile type: MaRDI publication profile
full work available at URL: jgaa.00334
OpenAlex ID: W2060834235
DOI: 10.7155/JGAA.00334
Recommended article: Algorithm and Hardness Results for Outer-connected Dominating Set in Graphs
Recommended article: On the complexity of the minimum outer-connected dominating set problem in graphs
Recommended article: Complexity of total outer-connected domination problem in graphs
Recommended article: On the outer-connected domination in graphs
Recommended article: On the number of outer connected dominating sets of graphs
Recommended article: Approximation algorithms for connected dominating sets
Recommended article: On the total outer-connected domination in graphs
Recommended article: Q3059038
Recommended article: Outer-\(k\)-connected component domination in graphs
description: scientific article; zbMATH DE number 6386933