Approximating minimum dominating set on string graphs

DOI10.1007/978-3-030-30786-8_18OpenAlexW2974033943MaRDI QIDQ2301546FDOQ2301546

Authors Dibyayan Chakraborty, Sandip Das, Joydeep Mukherjee

Publication date 24 February 2020

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

zbMATH Keywords

approximation algorithmdominating setstring graph

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10)

Recommendations

• On dominating set of some subclasses of string graphs
• Approximating domination on intersection graphs of paths on a grid
• String graphs of \(k\)-bend paths on a grid
• Dominating set on overlap graphs of rectangles intersecting a line
• Approximating dominating set on intersection graphs of rectangles and \(\mathsf{L}\)-frames

Cited in

(1)

• On dominating set of some subclasses of string graphs

This page was built for publication: Approximating minimum dominating set on string graphs

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