Lukas' Notes

Search titles, aliases and note text. Use # for tags.

Planar Dominating Set Problem

1 min read

computation graph-theory

Definition

Planar Dominating Set Problem

The planar dominating set problem is the restriction of the dominating set problem to planar graphs.

Instance: a planar graph and an integer .

Question: Does have a dominating set with ?

Backlinks