"Efficient Enumeration of Dominating Sets for Sparse Graphs."

Kazuhiro Kurita et al. (2018)

> Home

Details and statistics

DOI: 10.4230/LIPICS.ISAAC.2018.8

access: open

type: Conference or Workshop Paper

metadata version: 2019-10-19

- view
  - electronic edition via DOI (open access)
  authority control:
- export record
  dblp key:
  - conf/isaac/KuritaWAU18
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/isaac/KuritaWAU18
Kazuhiro Kurita, Kunihiro Wasa, Hiroki Arimura, Takeaki Uno:
Efficient Enumeration of Dominating Sets for Sparse Graphs. ISAAC 2018: 8:1-8:13

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.