{"id":"https://openalex.org/W7163884270","doi":"https://doi.org/10.4230/lipics.swat.2026.34","title":"Linear-Time Exact Computation of Influence Spread on Bounded-Pathwidth Graphs","display_name":"Linear-Time Exact Computation of Influence Spread on Bounded-Pathwidth Graphs","publication_year":2026,"publication_date":"2026-01-01","ids":{"openalex":"https://openalex.org/W7163884270","doi":"https://doi.org/10.4230/lipics.swat.2026.34"},"language":"en","primary_location":{"id":"pmh:oai:drops-oai.dagstuhl.de:26070","is_oa":true,"landing_page_url":"https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SWAT.2026.34","pdf_url":"https://drops.dagstuhl.de/storage/00lipics/lipics-vol370-swat2026/LIPIcs.SWAT.2026.34/LIPIcs.SWAT.2026.34.pdf","source":{"id":"https://openalex.org/S4377196569","display_name":"DROPS (Schloss Dagstuhl \u2013 Leibniz Center for Informatics)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I2799853480","host_organization_name":"Schloss Dagstuhl \u2013 Leibniz Center for Informatics","host_organization_lineage":["https://openalex.org/I2799853480"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"publishedVersion"},"type":"article","indexed_in":["datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://drops.dagstuhl.de/storage/00lipics/lipics-vol370-swat2026/LIPIcs.SWAT.2026.34/LIPIcs.SWAT.2026.34.pdf","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5036811156","display_name":"K. Nakamura","orcid":"https://orcid.org/0000-0002-9615-3479"},"institutions":[{"id":"https://openalex.org/I2251713219","display_name":"NTT (Japan)","ror":"https://ror.org/00berct97","country_code":"JP","type":"company","lineage":["https://openalex.org/I2251713219"]}],"countries":["JP"],"is_corresponding":false,"raw_author_name":"Nakamura, Kengo","raw_affiliation_strings":["Communication Science Laboratories, NTT, Inc., Kyoto, Japan"],"raw_orcid":"https://orcid.org/0000-0002-9615-3479","affiliations":[{"raw_affiliation_string":"Communication Science Laboratories, NTT, Inc., Kyoto, Japan","institution_ids":["https://openalex.org/I2251713219"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5101076405","display_name":"Masaaki Nishino","orcid":"https://orcid.org/0000-0001-6489-5446"},"institutions":[{"id":"https://openalex.org/I2251713219","display_name":"NTT (Japan)","ror":"https://ror.org/00berct97","country_code":"JP","type":"company","lineage":["https://openalex.org/I2251713219"]}],"countries":["JP"],"is_corresponding":false,"raw_author_name":"Nishino, Masaaki","raw_affiliation_strings":["Communication Science Laboratories, NTT, Inc., Kyoto, Japan"],"raw_orcid":"https://orcid.org/0000-0001-6489-5446","affiliations":[{"raw_affiliation_string":"Communication Science Laboratories, NTT, Inc., Kyoto, Japan","institution_ids":["https://openalex.org/I2251713219"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":true,"cited_by_count":0,"citation_normalized_percentile":{"value":0.93425606,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10064","display_name":"Complex Network Analysis Techniques","score":0.761900007724762,"subfield":{"id":"https://openalex.org/subfields/3109","display_name":"Statistical and Nonlinear Physics"},"field":{"id":"https://openalex.org/fields/31","display_name":"Physics and Astronomy"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10064","display_name":"Complex Network Analysis Techniques","score":0.761900007724762,"subfield":{"id":"https://openalex.org/subfields/3109","display_name":"Statistical and Nonlinear Physics"},"field":{"id":"https://openalex.org/fields/31","display_name":"Physics and Astronomy"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.04399999976158142,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11896","display_name":"Opportunistic and Delay-Tolerant Networks","score":0.03370000049471855,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/computation","display_name":"Computation","score":0.6276000142097473},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.5218999981880188},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.4122999906539917},{"id":"https://openalex.org/keywords/pathwidth","display_name":"Pathwidth","score":0.37709999084472656},{"id":"https://openalex.org/keywords/directed-graph","display_name":"Directed graph","score":0.37059998512268066},{"id":"https://openalex.org/keywords/cascade","display_name":"Cascade","score":0.36059999465942383},{"id":"https://openalex.org/keywords/dominating-set","display_name":"Dominating set","score":0.35100001096725464}],"concepts":[{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.6276000142097473},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5412999987602234},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.5218999981880188},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4672999978065491},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.42719998955726624},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.4122999906539917},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4104999899864197},{"id":"https://openalex.org/C43517604","wikidata":"https://www.wikidata.org/wiki/Q7144893","display_name":"Pathwidth","level":4,"score":0.37709999084472656},{"id":"https://openalex.org/C146380142","wikidata":"https://www.wikidata.org/wiki/Q1137726","display_name":"Directed graph","level":2,"score":0.37059998512268066},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3695000112056732},{"id":"https://openalex.org/C34146451","wikidata":"https://www.wikidata.org/wiki/Q5048094","display_name":"Cascade","level":2,"score":0.36059999465942383},{"id":"https://openalex.org/C146661039","wikidata":"https://www.wikidata.org/wiki/Q2915204","display_name":"Dominating set","level":4,"score":0.35100001096725464},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.34929999709129333},{"id":"https://openalex.org/C122818955","wikidata":"https://www.wikidata.org/wiki/Q1060343","display_name":"Independent set","level":3,"score":0.3465000092983246},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.3231000006198883},{"id":"https://openalex.org/C141042865","wikidata":"https://www.wikidata.org/wiki/Q200125","display_name":"Expected value","level":2,"score":0.305400013923645},{"id":"https://openalex.org/C88230418","wikidata":"https://www.wikidata.org/wiki/Q131476","display_name":"Graph theory","level":2,"score":0.28380000591278076},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.2775000035762787},{"id":"https://openalex.org/C18359143","wikidata":"https://www.wikidata.org/wiki/Q7888149","display_name":"Maximal independent set","level":5,"score":0.2752000093460083},{"id":"https://openalex.org/C3018234147","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Undirected graph","level":3,"score":0.26669999957084656},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.25839999318122864},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.2515999972820282}],"mesh":[],"locations_count":2,"locations":[{"id":"pmh:oai:drops-oai.dagstuhl.de:26070","is_oa":true,"landing_page_url":"https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SWAT.2026.34","pdf_url":"https://drops.dagstuhl.de/storage/00lipics/lipics-vol370-swat2026/LIPIcs.SWAT.2026.34/LIPIcs.SWAT.2026.34.pdf","source":{"id":"https://openalex.org/S4377196569","display_name":"DROPS (Schloss Dagstuhl \u2013 Leibniz Center for Informatics)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I2799853480","host_organization_name":"Schloss Dagstuhl \u2013 Leibniz Center for Informatics","host_organization_lineage":["https://openalex.org/I2799853480"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"publishedVersion"},{"id":"doi:10.4230/lipics.swat.2026.34","is_oa":true,"landing_page_url":"https://doi.org/10.4230/lipics.swat.2026.34","pdf_url":null,"source":{"id":"https://openalex.org/S7407052059","display_name":"Dagstuhl Research Online Publication Server","issn_l":null,"issn":[],"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":""}],"best_oa_location":{"id":"pmh:oai:drops-oai.dagstuhl.de:26070","is_oa":true,"landing_page_url":"https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SWAT.2026.34","pdf_url":"https://drops.dagstuhl.de/storage/00lipics/lipics-vol370-swat2026/LIPIcs.SWAT.2026.34/LIPIcs.SWAT.2026.34.pdf","source":{"id":"https://openalex.org/S4377196569","display_name":"DROPS (Schloss Dagstuhl \u2013 Leibniz Center for Informatics)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I2799853480","host_organization_name":"Schloss Dagstuhl \u2013 Leibniz Center for Informatics","host_organization_lineage":["https://openalex.org/I2799853480"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"publishedVersion"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W7163884270.pdf","grobid_xml":"https://content.openalex.org/works/W7163884270.grobid-xml"},"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"Given":[0],"a":[1,4,28,57,78,155],"network":[2],"and":[3,61,135],"set":[5],"of":[6,20,32,50,65,101,158],"vertices":[7,21,51],"called":[8],"seeds":[9,55],"to":[10,46,138,166],"initially":[11],"inject":[12],"information,":[13],"influence":[14,42,66,72,90,114],"spread":[15,43,67,91,115],"is":[16,44,77,82,98,121],"the":[17,25,36,47,54,62,89,99,102,113,125,128,132,148],"expected":[18,48],"number":[19,49,157],"that":[22,85,111],"eventually":[23],"receive":[24],"information":[26,33],"under":[27],"certain":[29],"stochastic":[30],"model":[31],"propagation.":[34],"Under":[35],"commonly":[37],"used":[38],"independent":[39],"cascade":[40],"model,":[41],"equivalent":[45],"reachable":[52],"from":[53],"on":[56,151],"directed":[58,164],"uncertain":[59,153],"graph,":[60],"exact":[63],"evaluation":[64,76],"offers":[68],"many":[69],"applications,":[70],"e.g.,":[71],"maximization.":[73],"Although":[74,141],"its":[75],"#P-hard":[79],"task,":[80],"there":[81],"an":[83,109],"algorithm":[84,110,134],"can":[86],"precisely":[87],"compute":[88],"in":[92,116,127,131],"O(mn\u03c9_p\u00b2\u22c5":[93],"2^{\u03c9_p\u00b2})":[94,118],"time,":[95],"where":[96],"\u03c9_p":[97],"pathwidth":[100],"graph.":[103],"We":[104],"improve":[105],"this":[106],"by":[107,123],"developing":[108],"computes":[112],"O((m+n)\u03c9_p\u00b2\u22c5":[117],"time.":[119],"This":[120],"achieved":[122],"identifying":[124],"similarities":[126,159],"repetitive":[129],"computations":[130],"existing":[133],"sharing":[136],"them":[137],"reduce":[139],"computation.":[140],"similar":[142],"refinements":[143],"have":[144],"been":[145],"considered":[146],"for":[147,163],"probability":[149],"computation":[150],"undirected":[152],"graphs,":[154],"greater":[156],"must":[160],"be":[161],"leveraged":[162],"graphs":[165],"achieve":[167],"linear":[168],"time":[169],"complexity.":[170]},"counts_by_year":[],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2026-06-09T00:00:00"}