Pages that link to "Item:Q1040587"
From MaRDI portal
The following pages link to Computational study on planar dominating set problem (Q1040587):
Displaying 5 items.
- New analysis and computational study for the planar connected dominating set problem (Q328712) (← links)
- A strengthened analysis of an algorithm for dominating set in planar graphs (Q415281) (← links)
- Practical algorithms for branch-decompositions of planar graphs (Q896665) (← links)
- Computational study on a PTAS for planar dominating set problem (Q1736542) (← links)
- (Q2721971) (← links)
