Pages that link to "Item:Q1040587"

From MaRDI portal

← Computational study on planar dominating set problem (Q1040587)

Jump to:navigation, search

The following pages link to Computational study on planar dominating set problem (Q1040587):

Displaying 3 items.

New analysis and computational study for the planar connected dominating set problem (Q328712) (← links)
Practical algorithms for branch-decompositions of planar graphs (Q896665) (← links)
Computational study on a PTAS for planar dominating set problem (Q1736542) (← links)

Retrieved from "https://portal.mardi4nfdi.de/wiki/Special:WhatLinksHere"