Computing Minimum k-Connected m-Fold Dominating Set in General Graphs

From MaRDI portal
Publication:5131721

DOI10.1287/ijoc.2017.0776OpenAlexW2791998335MaRDI QIDQ5131721

Jiao Zhou, Zhao Zhang, Ding-Zhu Du, Shaojie Tang, Xiao-hui Huang

Publication date: 9 November 2020

Published in: INFORMS Journal on Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1287/ijoc.2017.0776




Related Items (7)



Cites Work


This page was built for publication: Computing Minimum k-Connected m-Fold Dominating Set in General Graphs