Skip to content
Snippets Groups Projects
Select Git revision
  • ee1d972d3e7703ebedda34dec936c6c8e276f935
  • develop default protected
  • master protected
  • rodin2
  • rodin3
  • feature/theory_plugin
  • feature/multiview
  • csp
  • feature/newcore
  • feature/csp
  • 3.0.11
  • 3.0.8
  • 3.0.5
  • 2.4.1
  • 2.3.3
  • 2.3.2
  • 2.3.1
  • 2.3.0_fix1
  • 2.3.0
19 results

.classpath

Blame
  • Code owners
    Assign users and groups as approvers for specific file changes. Learn more.
    methods.tex 219 B
    \section{Model}
    \textbf{Dominating Set}: A dominating Set for Graph $G = (V, E)$ is a Subset $D \subseteq V$ such that for every vertex $v \in V$ the vertex itself or at least one vertex $w \in N(v)$ is included in $D$.