"The Complexity of Finding (Approximate Sized) Distance-d Dominating Set in ..."

Arindam Biswas et al. (2017)

> Home

Details and statistics

DOI: 10.1007/978-3-319-59605-1_3

access: closed

type: Conference or Workshop Paper

metadata version: 2019-12-27

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - conf/faw/BiswasJ0S17
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/faw/BiswasJ0S17
Arindam Biswas, Varunkumar Jayapaul, Venkatesh Raman, Srinivasa Rao Satti:
The Complexity of Finding (Approximate Sized) Distance-d Dominating Set in Tournaments. FAW 2017: 22-33

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.