Treewidth Governs the Complexity of Target Set Selection

Ben-Zwi, Oren; Hermelin, Danny; Lokshtanov, Daniel; Newman, Ilan

doi:10.1016/j.disopt.2010.09.007

Local TagsRelease HistoryDetailsSummary

Treewidth Governs the Complexity of Target Set Selection

Ben-Zwi, O., Hermelin, D., Lokshtanov, D., & Newman, I. (2011). Treewidth Governs the Complexity of Target Set Selection. Discrete Optimization, 8(1), 87-96. doi:10.1016/j.disopt.2010.09.007.

Item is Released

show all hide all

Basic

show hide

Item Permalink: https://hdl.handle.net/11858/00-001M-0000-0010-12BB-5 Version Permalink: https://hdl.handle.net/11858/00-001M-0000-0024-066C-B

Genre: Journal Article

Files

show Files

Locators

show

Creators

show

hide

Creators:
Ben-Zwi, Oren¹, Author
Hermelin, Danny², Author
Lokshtanov, Daniel¹, Author
Newman, Ilan¹, Author

Affiliations:
1External Organizations, ou_persistent22
2Algorithms and Complexity, MPI for Informatics, Max Planck Society, ou_24019

Content

show

Details

show

hide

Language(s): eng - English

Dates: Published Online: 2011Date issued: 2011

Publication Status: Issued

Pages: -

Publishing info: -

Table of Contents: -

Rev. Type: Peer

Identifiers: eDoc: 618698
DOI: 10.1016/j.disopt.2010.09.007
URI: http://dx.doi.org/10.1016/j.disopt.2010.09.007
Other: Local-ID: C1256428004B93B8-315C0D9EFC180B2DC1257965003BED1E-BenZwiHermelinLokshtanovNewman2011

Degree: -

Event

show

Legal Case

show

Project information

show

Source 1

show

hide

Title: Discrete Optimization

Source Genre: Journal

Creator(s):

Affiliations:

Publ. Info: Amsterdam : Elsevier

Pages: - Volume / Issue: 8 (1) Sequence Number: - Start / End Page: 87 - 96 Identifier: ISSN: 1572-5286