Computational Study on Dominating Set Problem of Planar Graphs
From MaRDI portal
Recommendations
- Computational study on planar dominating set problem
- Computational study for planar connected dominating set problem
- Fixed parameter algorithms for DOMINATING SET and related problems on planar graphs
- New analysis and computational study for the planar connected dominating set problem
- scientific article; zbMATH DE number 1929955
Cited in
(10)- Computational study on planar dominating set problem
- Computational study on a PTAS for planar dominating set problem
- Efficient exact algorithms on planar graphs: Exploiting sphere cut decompositions
- A refined search tree technique for dominating set on planar graphs
- scientific article; zbMATH DE number 1617251 (Why is no real title available?)
- Computational study for planar connected dominating set problem
- Computational study on bidimensionality theory based algorithm for longest path problem
- New analysis and computational study for the planar connected dominating set problem
- A strengthened analysis of an algorithm for dominating set in planar graphs
- scientific article; zbMATH DE number 1834643 (Why is no real title available?)
This page was built for publication: Computational Study on Dominating Set Problem of Planar Graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5505646)