Computational Study on Dominating Set Problem of Planar Graphs

DOI10.1007/978-3-540-85097-7_9zbMath1168.05352OpenAlexW1801598458WikidataQ60402656 ScholiaQ60402656MaRDI QIDQ5505646

Xiao-Hua Jia, Qian-Ping Gu, Marjan Marzban

Publication date: 27 January 2009

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

Full work available at URL: https://doi.org/10.1007/978-3-540-85097-7_9

zbMATH Keywords

data reductioncomputational studyfixed-parameter algorithmsbranch-decompositionPLANAR DOMINATING SET

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph algorithms (graph-theoretic aspects) (05C85) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Related Items (2)

Efficient exact algorithms on planar graphs: Exploiting sphere cut decompositions ⋮ Computational study on planar dominating set problem

Uses Software

• TSPLIB

This page was built for publication: Computational Study on Dominating Set Problem of Planar Graphs