On the complexity of independent dominating set with obligations in graphs
| Origin | Files produced by the author(s) |
|---|
Journal Articles
Theoretical Computer Science
Year : 2022
Accord Elsevier CCSD : Connect in order to contact the contributor
https://hal.science/hal-04043902
Submitted on : Monday, July 22, 2024-11:32:40 AM
Last modification on : Tuesday, September 3, 2024-1:56:20 PM
Dates and versions
Licence
Identifiers
- HAL Id : hal-04043902 , version 1
- DOI : 10.1016/j.tcs.2021.05.018
- PII : S0304-3975(21)00303-0
Cite
Christian Laforest, Timothée Martinod. On the complexity of independent dominating set with obligations in graphs. Theoretical Computer Science, 2022, 904, pp.1-14. ⟨10.1016/j.tcs.2021.05.018⟩. ⟨hal-04043902⟩
Collections
53
View
3
Download