"Computing Minimum k-Connected m-Fold Dominating Set in ..."

Zhao Zhang et al. (2018)

> Home

Details and statistics

DOI: 10.1287/IJOC.2017.0776

access: closed

type: Journal Article

metadata version: 2024-10-30

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/informs/ZhangZTHD18
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/informs/ZhangZTHD18
Zhao Zhang, Jiao Zhou, Shaojie Tang, Xiaohui Huang, Ding-Zhu Du:
Computing Minimum k-Connected m-Fold Dominating Set in General Graphs. INFORMS J. Comput. 30(2): 217-224 (2018)

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.