Solving Target Set Selection with Bounded Thresholds Faster than $$2^n$$

This is a publication. If there is no link to the publication on this page, you can try the pre-formated search via the search engines listed on this page.

Authors: Ivan Bliznets, Danil Sagunov

Journal title: Algorithmica

Journal number: 85

Journal publisher: Springer Verlag

Published year: 2023

Published pages: 384-405

DOI identifier: 10.1007/s00453-022-01031-w

ISSN: 0178-4617