Skip to content
Snippets Groups Projects
Select Git revision
  • df0c81b008315ba2e3fc66e823f060c972b134f2
  • master default protected
  • emoUS
  • add_default_vectorizer_and_pretrained_loading
  • clean_code
  • readme
  • issue127
  • generalized_action_dicts
  • ppo_num_dialogues
  • crossowoz_ddpt
  • issue_114
  • robust_masking_feature
  • scgpt_exp
  • e2e-soloist
  • convlab_exp
  • change_system_act_in_env
  • pre-training
  • nlg-scgpt
  • remapping_actions
  • soloist
20 results

requirements.txt

Blame
  • Code owners
    Assign users and groups as approvers for specific file changes. Learn more.
    This project manages its dependencies using pip. 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$.