Sign in

Efficient enumeration of dominating sets for sparse graphs.

Kazuhiro KuritaKunihiro WasaHiroki ArimuraTakeaki Uno
Published in: Discret. Appl. Math. (2021)
Keyphrases
  • computationally efficient
  • neural network
  • pairwise
  • social networks
  • high dimensional
  • search space
  • cost effective
  • directed graph
  • sparse coding