Theoretical Computer Science最新文献

{"title":"Partial key exposure attacks on Prime Power RSA with non-consecutive blocks","authors":"Ziming Jiang ,&nbsp;Yongbin Zhou ,&nbsp;Yuejun Liu","doi":"10.1016/j.tcs.2024.114845","DOIUrl":"10.1016/j.tcs.2024.114845","url":null,"abstract":"<div><p>Partial key exposure attacks pose a significant threat to RSA-type cryptosystems. These attacks factorize the RSA modulus by utilizing partial knowledge of the decryption exponent, which is typically revealed by side-channel attacks, cold boot attacks, etc. Such partial information is often located in non-consecutive blocks. However, the majority of the proposed attacks on Prime Power RSA have only considered a single unexposed block. Meanwhile, related attacks are incapable of being expanded to multiple unexposed blocks or achieving optimal results.</p><p>In this paper, we propose partial key exposure attacks on Prime Power RSA modulus <span><math><mi>N</mi><mo>=</mo><msup><mrow><mi>p</mi></mrow><mrow><mi>r</mi></mrow></msup><msup><mrow><mi>q</mi></mrow><mrow><mi>l</mi></mrow></msup></math></span> with <em>n</em> unknown blocks, where <span><math><mi>n</mi><mo>≥</mo><mn>2</mn></math></span>. We reduce this extended attack to solving multivariate linear modular equations and apply lattice-based approaches, including Herrmann-May's method (ASIACRYPT'08), Takayasu-Kunihiro's method (ACISP'13), and Lu-Zhang-Peng-Lin's method (ASIACRYPT'15), to solve them. Furthermore, we improve Lu et al.'s method by adding helpful polynomials and removing unhelpful polynomials to construct a better lattice basis. We also extend Lu et al.'s method by introducing a new parameter to make the lattice basis construction more flexible. Our improved and extended methods can be used for attacks when <span><math><mi>l</mi><mo>=</mo><mn>1</mn></math></span> and <span><math><mi>l</mi><mo>≥</mo><mn>1</mn></math></span>, respectively. These new attacks require less partial information than previous methods. For example, in the case where <span><math><mi>n</mi><mo>=</mo><mn>2</mn></math></span>, we reduce the amount of partial information needed from 80.7% to 77.8% when <span><math><mi>r</mi><mo>=</mo><mn>2</mn><mo>,</mo><mi>l</mi><mo>=</mo><mn>1</mn></math></span>, and from 64.0% to 44.9% when <span><math><mi>r</mi><mo>=</mo><mn>3</mn><mo>,</mo><mi>l</mi><mo>=</mo><mn>2</mn></math></span>.</p></div>","PeriodicalId":49438,"journal":{"name":"Theoretical Computer Science","volume":"1019 ","pages":"Article 114845"},"PeriodicalIF":0.9,"publicationDate":"2024-09-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142163044","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"A complexity trichotomy for k-regular asymmetric spin systems with complex edge functions","authors":"Peng Yang,&nbsp;Yuan Huang,&nbsp;Zhiguo Fu","doi":"10.1016/j.tcs.2024.114835","DOIUrl":"10.1016/j.tcs.2024.114835","url":null,"abstract":"<div><p>We prove a complexity trichotomy theorem for a class of partition functions over <em>k</em>-regular graphs, where the signature is complex valued and not necessarily <em>symmetric</em>. In details, we establish explicit criteria, according to which the partition functions of all such systems are classified into three classes: For every parameter setting in <span><math><mi>C</mi></math></span> for the spin system, the partition function is either (1) computable in polynomial time for every graph, or (2) #P-hard for general graphs but computable in polynomial time for planar graphs, or (3) #P-hard even for planar graphs.</p></div>","PeriodicalId":49438,"journal":{"name":"Theoretical Computer Science","volume":"1020 ","pages":"Article 114835"},"PeriodicalIF":0.9,"publicationDate":"2024-09-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142172866","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"Observation routes and external watchman routes","authors":"Adrian Dumitrescu ,&nbsp;Csaba D. Tóth","doi":"10.1016/j.tcs.2024.114818","DOIUrl":"10.1016/j.tcs.2024.114818","url":null,"abstract":"<div><p>We introduce the Observation Route Problem (<span>ORP</span>) defined as follows: Given a set of <em>n</em> pairwise disjoint obstacles (regions) in the plane, find a shortest tour (route) such that an observer walking along this tour can see (observe) each obstacle from some point of the tour. The observer does <em>not</em> need to see the entire boundary of an obstacle. The tour is <em>not</em> allowed to intersect the interior of any region (i.e., the regions are obstacles and therefore out of bounds). The problem exhibits similarity to both the Traveling Salesman Problem with Neighborhoods (<span>TSPN</span>) and the External Watchman Route Problem (<span>EWRP</span>). We distinguish two variants: the range of visibility is either limited to a bounding rectangle, or unlimited. We obtain the following results:</p><p>(I) Given a family of <em>n</em> disjoint convex bodies in the plane, computing a shortest observation route does not admit a <span><math><mo>(</mo><mi>c</mi><mi>log</mi><mo>⁡</mo><mi>n</mi><mo>)</mo></math></span>-approximation unless <span><math><mi>P</mi><mo>=</mo><mrow><mi>NP</mi></mrow></math></span> for an absolute constant <span><math><mi>c</mi><mo>&gt;</mo><mn>0</mn></math></span>. (This holds for both limited and unlimited vision.)</p><p>(II) Given a family of disjoint convex bodies in the plane, computing a shortest external watchman route is <span><math><mi>NP</mi></math></span>-hard. (This holds for both limited and unlimited vision; and even for families of axis-aligned squares.)</p><p>(III) Given a family of <em>n</em> disjoint fat convex polygons in the plane, an observation tour whose length is at most <span><math><mi>O</mi><mo>(</mo><mi>log</mi><mo>⁡</mo><mi>n</mi><mo>)</mo></math></span> times the optimal can be computed in polynomial time. (This holds for limited vision.)</p><p>(IV) For every <span><math><mi>n</mi><mo>≥</mo><mn>5</mn></math></span>, there exists a convex polygon with <em>n</em> sides and all angles obtuse such that its perimeter is <em>not</em> a shortest external watchman route. This refutes a conjecture by Absar and Whitesides (2006).</p></div>","PeriodicalId":49438,"journal":{"name":"Theoretical Computer Science","volume":"1019 ","pages":"Article 114818"},"PeriodicalIF":0.9,"publicationDate":"2024-09-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.sciencedirect.com/science/article/pii/S0304397524004353/pdfft?md5=8156a2411321e5e2d23ab419a17b5976&pid=1-s2.0-S0304397524004353-main.pdf","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142163027","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"An algorithmic construction of union-intersection-bounded families","authors":"Marcel Fernández ,&nbsp;John Livieratos ,&nbsp;Sebastià Martín","doi":"10.1016/j.tcs.2024.114817","DOIUrl":"10.1016/j.tcs.2024.114817","url":null,"abstract":"<div><p>In this paper, we present lower bounds and algorithmic constructions of union-intersection-bounded families of sets. The lower bound is established using the Lovász Local Lemma. This bound matches the best known bound for the size of union-intersection-bounded families of sets. We then use the variable framework for the Lovász Local Lemma, to discuss an algorithm that outputs explicit constructions that attain the lower bound. The algorithm has polynomial complexity in the number of points in the family.</p></div>","PeriodicalId":49438,"journal":{"name":"Theoretical Computer Science","volume":"1018 ","pages":"Article 114817"},"PeriodicalIF":0.9,"publicationDate":"2024-09-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142136033","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"A fixed-parameter algorithm for dominance drawings of DAGs","authors":"Giacomo Ortali ,&nbsp;Ioannis G. Tollis","doi":"10.1016/j.tcs.2024.114819","DOIUrl":"10.1016/j.tcs.2024.114819","url":null,"abstract":"<div><p>A weak dominance drawing Γ of a DAG <span><math><mi>G</mi><mo>=</mo><mo>(</mo><mi>V</mi><mo>,</mo><mi>E</mi><mo>)</mo></math></span> is a <em>d</em>-dimensional drawing such that <span><math><mi>D</mi><mo>(</mo><mi>u</mi><mo>)</mo><mo>&lt;</mo><mi>D</mi><mo>(</mo><mi>v</mi><mo>)</mo></math></span> for every dimension <em>D</em> of Γ if there is a directed path from a vertex <em>u</em> to a vertex <em>v</em> in <em>G</em>, where <span><math><mi>D</mi><mo>(</mo><mi>w</mi><mo>)</mo></math></span> is the coordinate of vertex <span><math><mi>w</mi><mo>∈</mo><mi>V</mi></math></span> in dimension <em>D</em> of Γ. If <span><math><mi>D</mi><mo>(</mo><mi>u</mi><mo>)</mo><mo>&lt;</mo><mi>D</mi><mo>(</mo><mi>v</mi><mo>)</mo></math></span> for every dimension <em>D</em> of Γ, but there is no path from <em>u</em> to <em>v</em>, we have a <em>falsely implied path (fip)</em>. Minimizing the number of fips is an important theoretical and practical problem. Computing 2-dimensional weak dominance drawings with minimum number of fips is NP-hard. We show that this problem is FPT parameterized by the dimension <em>d</em> and the modular width <em>mw</em>. A key ingredient of our proof is the <span>Compaction Lemma</span>, where we show an interesting property of any weak dominance drawing of <em>G</em> with the minimum number of fips. This FPT result in weak dominance, which is interesting by itself because the fip-minimization problem is NP-hard, is used to prove our main contributions. Computing the dominance dimension of <em>G</em>, that is, the minimum number of dimensions <em>d</em> for which <em>G</em> has a <em>d</em>-dimensional dominance drawing (a weak dominance drawing with 0 fips), is a well-known NP-hard problem. We show that the dominance dimension of <em>G</em> is bounded by <span><math><mfrac><mrow><mi>m</mi><mi>w</mi></mrow><mrow><mn>2</mn></mrow></mfrac></math></span> (or <em>mw</em>, if <span><math><mi>m</mi><mi>w</mi><mo>&lt;</mo><mn>4</mn></math></span>) and that computing the dominance dimension of <em>G</em> is an FPT problem with parameter <em>mw</em>. As far as we know, this the first FPT-algorithm to compute the dominance dimension of a DAG.</p></div>","PeriodicalId":49438,"journal":{"name":"Theoretical Computer Science","volume":"1020 ","pages":"Article 114819"},"PeriodicalIF":0.9,"publicationDate":"2024-09-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142168385","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"Sink location problems in dynamic flow grid networks","authors":"Yuya Higashikawa,&nbsp;Ayano Nishii,&nbsp;Junichi Teruyama,&nbsp;Yuki Tokuni","doi":"10.1016/j.tcs.2024.114812","DOIUrl":"10.1016/j.tcs.2024.114812","url":null,"abstract":"<div><p>A <em>dynamic flow network</em> consists of a directed graph, where nodes called <em>sources</em> represent locations of evacuees, and nodes called <em>sinks</em> represent locations of evacuation facilities. Each source and each sink are given <em>supply</em> representing the number of evacuees and <em>demand</em> representing the maximum number of acceptable evacuees, respectively. Each edge is given <em>capacity</em> and <em>transit time</em>. Here, the capacity of an edge bounds the rate at which evacuees can enter the edge per unit time, and the transit time represents the time which evacuees take to travel across the edge. The <em>evacuation completion time</em> is the minimum time at which each evacuee can arrive at one of the evacuation facilities. Given a dynamic flow network without sinks, once sinks are located on some nodes or edges, the evacuation completion time for this sink location is determined. We then consider the problem of locating sinks to minimize the evacuation completion time, called the <em>sink location problem</em>. The problems have been given polynomial-time algorithms only for limited networks such as paths <span><span>[1]</span></span>, <span><span>[2]</span></span>, <span><span>[3]</span></span>, cycles <span><span>[1]</span></span>, and trees <span><span>[4]</span></span>, <span><span>[5]</span></span>, <span><span>[6]</span></span>, but no polynomial-time algorithms are known for more complex network classes. In this paper, we prove that the 1-sink location problem can be solved in polynomial-time when an input network is a grid with uniform edge capacity and transit time.</p></div>","PeriodicalId":49438,"journal":{"name":"Theoretical Computer Science","volume":"1019 ","pages":"Article 114812"},"PeriodicalIF":0.9,"publicationDate":"2024-09-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142163026","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"The Maximum Zero-Sum Partition problem","authors":"Guillaume Fertin ,&nbsp;Oscar Fontaine ,&nbsp;Géraldine Jean ,&nbsp;Stéphane Vialette","doi":"10.1016/j.tcs.2024.114811","DOIUrl":"10.1016/j.tcs.2024.114811","url":null,"abstract":"<div><p>We study the <span>Maximum Zero-Sum Partition</span> problem (or <span>MZSP</span>), defined as follows: given a multiset <span><math><mi>S</mi><mo>=</mo><mo>{</mo><msub><mrow><mi>a</mi></mrow><mrow><mn>1</mn></mrow></msub><mo>,</mo><msub><mrow><mi>a</mi></mrow><mrow><mn>2</mn></mrow></msub><mo>,</mo><mo>…</mo><mo>,</mo><msub><mrow><mi>a</mi></mrow><mrow><mi>n</mi></mrow></msub><mo>}</mo></math></span> of integers <span><math><msub><mrow><mi>a</mi></mrow><mrow><mi>i</mi></mrow></msub><mo>∈</mo><msup><mrow><mi>Z</mi></mrow><mrow><mo>⁎</mo></mrow></msup></math></span> (where <span><math><msup><mrow><mi>Z</mi></mrow><mrow><mo>⁎</mo></mrow></msup></math></span> denotes the set of non-zero integers) such that <span><math><msubsup><mrow><mo>∑</mo></mrow><mrow><mi>i</mi><mo>=</mo><mn>1</mn></mrow><mrow><mi>n</mi></mrow></msubsup><msub><mrow><mi>a</mi></mrow><mrow><mi>i</mi></mrow></msub><mo>=</mo><mn>0</mn></math></span>, find a maximum cardinality partition <span><math><mo>{</mo><msub><mrow><mi>S</mi></mrow><mrow><mn>1</mn></mrow></msub><mo>,</mo><msub><mrow><mi>S</mi></mrow><mrow><mn>2</mn></mrow></msub><mo>,</mo><mo>…</mo><mo>,</mo><msub><mrow><mi>S</mi></mrow><mrow><mi>k</mi></mrow></msub><mo>}</mo></math></span> of <span><math><mi>S</mi></math></span> such that, for every <span><math><mn>1</mn><mo>≤</mo><mi>i</mi><mo>≤</mo><mi>k</mi></math></span>, <span><math><msub><mrow><mo>∑</mo></mrow><mrow><msub><mrow><mi>a</mi></mrow><mrow><mi>j</mi></mrow></msub><mo>∈</mo><msub><mrow><mi>S</mi></mrow><mrow><mi>i</mi></mrow></msub></mrow></msub><msub><mrow><mi>a</mi></mrow><mrow><mi>j</mi></mrow></msub><mo>=</mo><mn>0</mn></math></span>. Solving <span>MZSP</span> is useful in genomics for computing evolutionary distances between pairs of species. Our contributions are a series of algorithmic results concerning <span>MZSP</span>, in terms of complexity, (in)approximability, with a particular focus on the fixed-parameter tractability of <span>MZSP</span> with respect to either (i) the size <em>k</em> of the solution, (ii) the number of negative (resp. positive) values in <span><math><mi>S</mi></math></span> and (iii) the largest integer in <span><math><mi>S</mi></math></span>.</p></div>","PeriodicalId":49438,"journal":{"name":"Theoretical Computer Science","volume":"1019 ","pages":"Article 114811"},"PeriodicalIF":0.9,"publicationDate":"2024-08-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.sciencedirect.com/science/article/pii/S0304397524004286/pdfft?md5=834de52b293d98cccaa7d3d01b33ccb6&pid=1-s2.0-S0304397524004286-main.pdf","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142158429","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"The cyclic diagnosability of balanced hypercubes under the PMC and MM⁎ model","authors":"Yulin Han ,&nbsp;Yalan Li ,&nbsp;Chengfu Ye","doi":"10.1016/j.tcs.2024.114816","DOIUrl":"10.1016/j.tcs.2024.114816","url":null,"abstract":"<div><p>In 2023, Zhang et al. proposed a novel diagnostic parameter, namely the cyclic diagnosability and explored the cyclic diagnosability of <span><math><msub><mrow><mi>Q</mi></mrow><mrow><mi>n</mi></mrow></msub></math></span>. In this paper, the cyclic diagnosability of <span><math><mi>B</mi><msub><mrow><mi>H</mi></mrow><mrow><mi>n</mi></mrow></msub></math></span> is determined under the <em>PMC</em> model and the <span><math><mi>M</mi><msup><mrow><mi>M</mi></mrow><mrow><mo>⁎</mo></mrow></msup></math></span> model.</p></div>","PeriodicalId":49438,"journal":{"name":"Theoretical Computer Science","volume":"1018 ","pages":"Article 114816"},"PeriodicalIF":0.9,"publicationDate":"2024-08-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142136056","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"On monochromatic arithmetic progressions in binary words associated with pattern sequences","authors":"Bartosz Sobolewski","doi":"10.1016/j.tcs.2024.114815","DOIUrl":"10.1016/j.tcs.2024.114815","url":null,"abstract":"<div><p>Let <span><math><msub><mrow><mi>e</mi></mrow><mrow><mi>v</mi></mrow></msub><mo>(</mo><mi>n</mi><mo>)</mo></math></span> denote the number of occurrences of a fixed pattern <em>v</em> in the binary expansion of <span><math><mi>n</mi><mo>∈</mo><mi>N</mi></math></span>. In this paper we study monochromatic arithmetic progressions in the class of binary words <span><math><msub><mrow><mo>(</mo><msub><mrow><mi>e</mi></mrow><mrow><mi>v</mi></mrow></msub><mo>(</mo><mi>n</mi><mo>)</mo><mspace></mspace><mrow><mi>mod</mi></mrow><mspace></mspace><mn>2</mn><mo>)</mo></mrow><mrow><mi>n</mi><mo>≥</mo><mn>0</mn></mrow></msub></math></span>, which includes the famous Thue–Morse word <strong>t</strong> and Rudin–Shapiro word <strong>r</strong>. We prove that the length of a monochromatic arithmetic progression of difference <span><math><mi>d</mi><mo>≥</mo><mn>3</mn></math></span> starting at 0 in <strong>r</strong> is at most <span><math><mo>(</mo><mi>d</mi><mo>+</mo><mn>3</mn><mo>)</mo><mo>/</mo><mn>2</mn></math></span>, with equality for infinitely many <em>d</em>. We also compute the maximal length of a monochromatic arithmetic progression in <strong>r</strong> of difference <span><math><msup><mrow><mn>2</mn></mrow><mrow><mi>k</mi></mrow></msup><mo>−</mo><mn>1</mn></math></span> and <span><math><msup><mrow><mn>2</mn></mrow><mrow><mi>k</mi></mrow></msup><mo>+</mo><mn>1</mn></math></span>. For a general pattern <em>v</em> we show that the maximal length of a monochromatic arithmetic progression of difference <em>d</em> is at most linear in <em>d</em>. Moreover, we prove that a linear lower bound holds for suitable subsequences <span><math><msub><mrow><mo>(</mo><msub><mrow><mi>d</mi></mrow><mrow><mi>k</mi></mrow></msub><mo>)</mo></mrow><mrow><mi>k</mi><mo>≥</mo><mn>0</mn></mrow></msub></math></span> of differences. We also offer a number of related problems and conjectures.</p></div>","PeriodicalId":49438,"journal":{"name":"Theoretical Computer Science","volume":"1018 ","pages":"Article 114815"},"PeriodicalIF":0.9,"publicationDate":"2024-08-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.sciencedirect.com/science/article/pii/S0304397524004328/pdfft?md5=f1b8c0a8a097177b0f698184130f8ee6&pid=1-s2.0-S0304397524004328-main.pdf","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142129146","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"User-driven competitive influence maximization in social networks","authors":"Jiancong Liu,&nbsp;Zhiheng You,&nbsp;Ziwei Liang,&nbsp;Hongwei Du","doi":"10.1016/j.tcs.2024.114813","DOIUrl":"10.1016/j.tcs.2024.114813","url":null,"abstract":"<div><p>Online social networks have emerged as pivotal platforms where users not only interact but also influence each other's decisions and preferences. As these networks grow in complexity, understanding and leveraging influence dynamics within networks have become essential, particularly for businesses and marketers. Competitive Influence Maximization (CIM) in online social networks has garnered significant interest, focusing on maximizing influence spread among multiple entities. However, recent research on CIM often overlooks the differences in user preferences, which realistically impact the propagation of competitive influence. To address this issue, we introduce the User-Driven Competitive Linear Threshold (UDCLT) model. This model takes into account user preference differences for two distinct brands within the identical product category, thereby formulating the User-Driven Competitive Influence Maximization (UDCIM) problem. Based on community structure, we introduce a novel measure, namely Topology Importance (TI), to assess a node's potential influence within a social network by considering its connections within and across communities. To resolve the UDCIM problem effectively, we develop a novel two-phase algorithm, the Community-based Dual Influence Assessment (CDIA) algorithm, which integrates Topology Importance and Dual Influence to identify seed nodes. Various experiments are conducted on four real-world datasets, illustrating the efficiency and effectiveness of the CDIA algorithm in addressing the UDCIM problem.</p></div>","PeriodicalId":49438,"journal":{"name":"Theoretical Computer Science","volume":"1018 ","pages":"Article 114813"},"PeriodicalIF":0.9,"publicationDate":"2024-08-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142136039","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}