On the Complexity of Target Set Selection in Simple Geometric Networks

We study the following model of disease spread in a social network. At first, all individuals are either infected or healthy. Next, in discrete rounds, the disease spreads in the network from infected to healthy individuals such that a healthy individual gets infected if and only if a sufficient num...

Celý popis

Uložené v:
Podrobná bibliografia
Vydané v:Discrete mathematics and theoretical computer science Ročník 26:2; číslo Discrete Algorithms
Hlavní autori: Dvořák, Michal, Knop, Dušan, Schierreich, Šimon
Médium: Journal Article
Jazyk:English
Vydavateľské údaje: Discrete Mathematics & Theoretical Computer Science 21.08.2024
Predmet:
computer science - computational complexity
ISSN:1365-8050, 1365-8050
On-line prístup:Získať plný text
Tagy: Pridať tag
Žiadne tagy, Buďte prvý, kto otaguje tento záznam!
Abstract We study the following model of disease spread in a social network. At first, all individuals are either infected or healthy. Next, in discrete rounds, the disease spreads in the network from infected to healthy individuals such that a healthy individual gets infected if and only if a sufficient number of its direct neighbors are already infected. We represent the social network as a graph. Inspired by the real-world restrictions in the current epidemic, especially by social and physical distancing requirements, we restrict ourselves to networks that can be represented as geometric intersection graphs. We show that finding a minimal vertex set of initially infected individuals to spread the disease in the whole network is computationally hard, already on unit disk graphs. Hence, to provide some algorithmic results, we focus ourselves on simpler geometric graph classes, such as interval graphs and grid graphs.
AbstractList We study the following model of disease spread in a social network. At first, all individuals are either infected or healthy. Next, in discrete rounds, the disease spreads in the network from infected to healthy individuals such that a healthy individual gets infected if and only if a sufficient number of its direct neighbors are already infected. We represent the social network as a graph. Inspired by the real-world restrictions in the current epidemic, especially by social and physical distancing requirements, we restrict ourselves to networks that can be represented as geometric intersection graphs. We show that finding a minimal vertex set of initially infected individuals to spread the disease in the whole network is computationally hard, already on unit disk graphs. Hence, to provide some algorithmic results, we focus ourselves on simpler geometric graph classes, such as interval graphs and grid graphs.
We study the following model of disease spread in a social network. At first, all individuals are either infected or healthy. Next, in discrete rounds, the disease spreads in the network from infected to healthy individuals such that a healthy individual gets infected if and only if a sufficient number of its direct neighbors are already infected. We represent the social network as a graph. Inspired by the real-world restrictions in the current epidemic, especially by social and physical distancing requirements, we restrict ourselves to networks that can be represented as geometric intersection graphs. We show that finding a minimal vertex set of initially infected individuals to spread the disease in the whole network is computationally hard, already on unit disk graphs. Hence, to provide some algorithmic results, we focus ourselves on simpler geometric graph classes, such as interval graphs and grid graphs.
Author Dvořák, Michal
Knop, Dušan
Schierreich, Šimon
Author_xml – sequence: 1
  givenname: Michal
  surname: Dvořák
  fullname: Dvořák, Michal
– sequence: 2
  givenname: Dušan
  surname: Knop
  fullname: Knop, Dušan
– sequence: 3
  givenname: Šimon
  surname: Schierreich
  fullname: Schierreich, Šimon
BookMark eNpNkN1Kw0AQRhepYK3e-QD7AKbu7F-SSym2Foq9aL0Om82kbk2yZbOgfXvbVMSL4RuG4fBxbsmo8x0S8gBsKjXPs6eqjbafAqgcrsgYhFZJxhQb_dtvyG3f7xkDnst0TObrjsYPpDPfHhr8dvFIfU23Juww0s0wDdrofEddRzfu_EUX6FuMwVn6hvHLh8_-jlzXpunx_jcn5H3-sp29Jqv1Yjl7XiWWA0BijNJaAOeYnrpoiQYBNMpUSMtVxlHUqEqoSqN1jTKDkqkyB1tVVts0y8WELC_cypt9cQiuNeFYeOOK4eDDrjAhOttgUVYKc5tLqFMmy5JlQuq04kxwm59lnViPF5YNvu8D1n88YMXgsxh8FoNP8QNqKWnO
ContentType Journal Article
DBID AAYXX
CITATION
DOA
DOI 10.46298/dmtcs.11591
DatabaseName CrossRef
DOAJ Open Access Full Text
DatabaseTitle CrossRef
DatabaseTitleList CrossRef
Database_xml – sequence: 1
  dbid: DOA
  name: DOAJ Directory of Open Access Journals
  url: https://www.doaj.org/
  sourceTypes: Open Website
DeliveryMethod fulltext_linktorsrc
Discipline Mathematics
Computer Science
EISSN 1365-8050
ExternalDocumentID oai_doaj_org_article_bd5e9c941f704bb083467d2032c96298
10_46298_dmtcs_11591
GroupedDBID -~9
.4S
.DC
29G
2WC
5GY
5VS
8FE
8FG
AAFWJ
AAYXX
ABDBF
ABJCF
ABUWG
ACGFO
ACIWK
ACUHS
ADBBV
ADQAK
AENEX
AFFHD
AFKRA
AFPKN
AIAGR
ALMA_UNASSIGNED_HOLDINGS
AMVHM
ARCSS
B0M
BAIFH
BBTPI
BCNDV
BENPR
BFMQW
BGLVJ
BPHCQ
CCPQU
CITATION
EAP
EBS
ECS
EDO
EJD
EMK
EPL
EST
ESX
GROUPED_DOAJ
HCIFZ
I-F
IAO
IBB
ICD
ITC
J9A
KQ8
KWQ
L6V
M7S
MK~
ML~
OK1
OVT
P2P
PHGZM
PHGZT
PIMPY
PQGLB
PQQKQ
PROAC
PTHSS
PV9
REM
RNS
RSU
RZL
TR2
TUS
XSB
~8M
ID FETCH-LOGICAL-c2111-aa5663122e780564eae116e4734c2582e3fe5b1dba66fe481b05b91cddc6c7893
IEDL.DBID DOA
ISSN 1365-8050
IngestDate Fri Oct 03 12:46:02 EDT 2025
Sat Nov 29 02:48:27 EST 2025
IsDoiOpenAccess true
IsOpenAccess true
IsPeerReviewed true
IsScholarly true
Issue Discrete Algorithms
Language English
License https://creativecommons.org/licenses/by/4.0
LinkModel DirectLink
MergedId FETCHMERGED-LOGICAL-c2111-aa5663122e780564eae116e4734c2582e3fe5b1dba66fe481b05b91cddc6c7893
ORCID 0000-0001-8901-1942
OpenAccessLink https://doaj.org/article/bd5e9c941f704bb083467d2032c96298
ParticipantIDs doaj_primary_oai_doaj_org_article_bd5e9c941f704bb083467d2032c96298
crossref_primary_10_46298_dmtcs_11591
PublicationCentury 2000
PublicationDate 2024-08-21
PublicationDateYYYYMMDD 2024-08-21
PublicationDate_xml – month: 08
  year: 2024
  text: 2024-08-21
  day: 21
PublicationDecade 2020
PublicationTitle Discrete mathematics and theoretical computer science
PublicationYear 2024
Publisher Discrete Mathematics & Theoretical Computer Science
Publisher_xml – name: Discrete Mathematics & Theoretical Computer Science
SSID ssj0012947
Score 2.3118405
Snippet We study the following model of disease spread in a social network. At first, all individuals are either infected or healthy. Next, in discrete rounds, the...
We study the following model of disease spread in a social network. At first, all individuals are either infected or healthy. Next, in discrete rounds, the...
SourceID doaj
crossref
SourceType Open Website
Index Database
SubjectTerms computer science - computational complexity
Title On the Complexity of Target Set Selection in Simple Geometric Networks
URI https://doaj.org/article/bd5e9c941f704bb083467d2032c96298
Volume 26:2
hasFullText 1
inHoldings 1
isFullTextHit
isPrint
journalDatabaseRights – providerCode: PRVAON
  databaseName: DOAJ Directory of Open Access Journals
  customDbUrl:
  eissn: 1365-8050
  dateEnd: 99991231
  omitProxy: false
  ssIdentifier: ssj0012947
  issn: 1365-8050
  databaseCode: DOA
  dateStart: 19970101
  isFulltext: true
  titleUrlDefault: https://www.doaj.org/
  providerName: Directory of Open Access Journals
– providerCode: PRVPQU
  databaseName: Continental Europe Database
  customDbUrl:
  eissn: 1365-8050
  dateEnd: 99991231
  omitProxy: false
  ssIdentifier: ssj0012947
  issn: 1365-8050
  databaseCode: BFMQW
  dateStart: 19970101
  isFulltext: true
  titleUrlDefault: https://search.proquest.com/conteurope
  providerName: ProQuest
– providerCode: PRVPQU
  databaseName: Engineering Database
  customDbUrl:
  eissn: 1365-8050
  dateEnd: 99991231
  omitProxy: false
  ssIdentifier: ssj0012947
  issn: 1365-8050
  databaseCode: M7S
  dateStart: 19970101
  isFulltext: true
  titleUrlDefault: http://search.proquest.com
  providerName: ProQuest
– providerCode: PRVPQU
  databaseName: ProQuest Central
  customDbUrl:
  eissn: 1365-8050
  dateEnd: 99991231
  omitProxy: false
  ssIdentifier: ssj0012947
  issn: 1365-8050
  databaseCode: BENPR
  dateStart: 19970101
  isFulltext: true
  titleUrlDefault: https://www.proquest.com/central
  providerName: ProQuest
– providerCode: PRVPQU
  databaseName: ProQuest Publicly Available Content Database
  customDbUrl:
  eissn: 1365-8050
  dateEnd: 99991231
  omitProxy: false
  ssIdentifier: ssj0012947
  issn: 1365-8050
  databaseCode: PIMPY
  dateStart: 19970101
  isFulltext: true
  titleUrlDefault: http://search.proquest.com/publiccontent
  providerName: ProQuest
link http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwrV09T8MwED2hwgADHwVE-ag8wBg1ThwnHgFRYGip1CKVKfKnVImmqAlI_HtsJ63KxMKQIdEpit7Fvuf48h7AtQi1MlnMA1tfVECkxgHLjAxiRhPCnb66zLzZRDocZtMpG21YfbmesFoeuAauJ1SimWQEmzQkQljGYIe2cr7fktGI-d98LetZLaaa_YOIkbRucycuqKfmlSzt9JAw_KsAbej0-4LSP4T9hgmi2_oJjmBLF204WLksoGbQtWFvsFZWLY-h_1Ige4pcnNOyrL7RwqCJ7-dGY3-8--6qAs0KNJ65KPSoF3PnnCXRsO76Lk_gtf8wuX8KGi-EQNolGg44t7wrxlGknQkBJZprjKkmaUxklGSRjo1OBFaCU2o0sWQ0TATDUilJZWpJySm0ikWhzwAZxoUKKcMic67okuM4M1hyEUs7_QnegZsVQPlHLXmR26WCBzL3QOYeyA7cOfTWMU6o2l-w6cub9OV_pe_8P25yAbuR5RruU2-EL6FVLT_1FezIr2pWLrv-zejC9uh5MHr7AeesvxE
linkProvider Directory of Open Access Journals
openUrl ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.atitle=On+the+Complexity+of+Target+Set+Selection+in+Simple+Geometric+Networks&rft.jtitle=Discrete+mathematics+and+theoretical+computer+science&rft.au=Michal+Dvo%C5%99%C3%A1k&rft.au=Du%C5%A1an+Knop&rft.au=%C5%A0imon+Schierreich&rft.date=2024-08-21&rft.pub=Discrete+Mathematics+%26+Theoretical+Computer+Science&rft.eissn=1365-8050&rft.volume=26%3A2&rft.issue=Discrete+Algorithms&rft_id=info:doi/10.46298%2Fdmtcs.11591&rft.externalDBID=DOA&rft.externalDocID=oai_doaj_org_article_bd5e9c941f704bb083467d2032c96298
thumbnail_l http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=1365-8050&client=summon
thumbnail_m http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=1365-8050&client=summon
thumbnail_s http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=1365-8050&client=summon