Solving Target Set Selection with Bounded Thresholds Faster than 2n.

Saved in:
Bibliographic Details
Title: Solving Target Set Selection with Bounded Thresholds Faster than 2n.
Authors: Bliznets, Ivan1, Sagunov, Danil1, danilka.pro@gmail.com
Source: Algorithmica; Feb2023, Vol. 85 Issue 2, p384-405, 22p
Database: Applied Science & Technology Source
Description
ISSN:01784617
DOI:10.1007/s00453-022-01031-w