Computational study for planar connected dominating set problem

DOI10.1007/978-3-642-17461-2_9zbMATH Open1311.05194DBLPconf/cocoa/MarzbanGJ10OpenAlexW1857327936WikidataQ60402521 ScholiaQ60402521MaRDI QIDQ3066449FDOQ3066449

Authors: Marjan Marzban, Qian-Ping Gu, X.-H. Jia 

Publication date: 10 January 2011

Published in: Combinatorial Optimization and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-17461-2_9

Recommendations

• New analysis and computational study for the planar connected dominating set problem
• Computational study on planar dominating set problem
• Computational Study on Dominating Set Problem of Planar Graphs
• Solving Connected Dominating Set Faster Than 2 n
• Improved linear problem kernel for planar connected dominating set

zbMATH Keywords

fixed-parameter algorithmsplanar graphsbranch-decomposition based algorithmscomputational studyCDS problem

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Planar graphs; geometric and topological aspects of graph theory (05C10)

Cited In (4)

• Title not available (Why is that?)
• Computational study on a PTAS for planar dominating set problem
• Computational Study on Dominating Set Problem of Planar Graphs
• New analysis and computational study for the planar connected dominating set problem

This page was built for publication: Computational study for planar connected dominating set problem

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