Document is current

Any future updates will be listed below

An $$O(n+m)$$ time algorithm for computing a minimum semitotal dominating set in an interval graph

Crossref DOI link: https://doi.org/10.1007/s12190-020-01459-9

Published Online: 2020-11-11

Published Print: 2021-06

Update policy: https://doi.org/10.1007/springer_crossmark_policy

About CrossMark