scientific article; zbMATH DE number 7724205

DOI10.4230/LIPICS.MFCS.2021.32MaRDI QIDQ6168446zbMATH OpenFDO

Authors Keerti Choudhary, Avi Cohen, N. S. Narayanaswamy, David Peleg, R. Vijayaragunathan

Publication date 8 August 2023

Full work available at URL https://arxiv.org/abs/2107.03020

zbMATH Keywords

treewidthdominating setNP-hardplanar graphPTASuncertain graphs

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Recommendations

• Application of dominating sets in vague graphs
• On uncertain graphs
• Uncertain graph and network optimization
• Domination in vague graphs and its applications
• Analyzing the optimal neighborhood: algorithms for budgeted and partial connected dominating set problems
• Improved Budgeted Connected Domination and Budgeted Edge-Vertex Domination
• Improved budgeted connected domination and budgeted edge-vertex domination
• Analyzing the optimal neighborhood: algorithms for partial and budgeted connected dominating set problems
• A unified greedy approximation for several dominating set problems

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6168446)