Algorithms on Graphs with Small Dominating Targets

DOI10.1007/11940128_16zbMATH Open1135.05313OpenAlexW1868459378MaRDI QIDQ5459110FDOQ5459110

Authors: Divesh Aggarwal, Shashank K. Mehta, Chandan K. Dubey 

Publication date: 24 April 2008

Published in: Algorithms and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/11940128_16

Recommendations

• Algorithms for graphs with small octopus
• Approximation algorithms for connected dominating sets
• Solving Connected Dominating Set Faster Than 2 n
• Connected domination and Steiner set on weighted permutation graphs
• scientific article; zbMATH DE number 1124601

zbMATH Keywords

dominating setdominating target\(d\)-octopusdominating-pair graphSteiner tree.

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 (3)

• Asteroidal sets and dominating paths
• Algorithms for graphs with small octopus
• On the structure of graphs with bounded asteroidal number

This page was built for publication: Algorithms on Graphs with Small Dominating Targets

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