Approximating the minimum independent dominating set in perturbed graphs

DOI10.1007/978-3-642-38768-5_24zbMATH Open1381.68307OpenAlexW1719847780MaRDI QIDQ4925243FDOQ4925243

Authors: Weitian Tong, Randy Goebel, Guohui Lin 

Publication date: 11 June 2013

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-38768-5_24

Recommendations

• Approximating the minimum independent dominating set in perturbed graphs
• Approximating independent set in perturbed graphs
• On approximating the minimum independent dominating set
• Minimum independent dominating sets of random cubic graphs
• Minimum connected dominating sets in finite graphs

zbMATH Keywords

approximation algorithmdominating setindependent setindependent dominating setperturbed graphsmooth analysis

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Approximation algorithms (68W25) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Cited In (1)

• Approximating the minimum independent dominating set in perturbed graphs

This page was built for publication: Approximating the minimum independent dominating set in perturbed graphs

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