Mathematical Research Data Initiative
Main page
Recent changes
Random page
SPARQL
MaRDI@GitHub
New item
In other projects
MaRDI portal item
Discussion
View source
View history
English
Log in

Approximating minimum dominating set on string graphs

From MaRDI portal
Publication:2301546
Jump to:navigation, search

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

Sandip Das, Joydeep Mukherjee, Dibyayan Chakraborty

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)



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)

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:2301546&oldid=14874673"
Tools
What links here
Related changes
Printable version
Permanent link
Page information
This page was last edited on 2 February 2024, at 13:15. Warning: Page may not contain recent updates.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki