International Journal of Foundations of Computer Science最新文献

{"title":"Algorithmic Aspects of Outer-Independent Double Roman Domination in Graphs","authors":"Amit Sharma, P. Venkata Subba Reddy, S. Arumugam, Jakkepalli Pavan Kumar","doi":"10.1142/s0129054124500059","DOIUrl":"https://doi.org/10.1142/s0129054124500059","url":null,"abstract":"<p>Let <span><math altimg=\"eq-00001.gif\" display=\"inline\" overflow=\"scroll\"><mi>G</mi><mo>=</mo><mo stretchy=\"false\">(</mo><mi>V</mi><mo>,</mo><mi>E</mi><mo stretchy=\"false\">)</mo></math></span><span></span> be graph. For any function <span><math altimg=\"eq-00002.gif\" display=\"inline\" overflow=\"scroll\"><mi>h</mi><mo>:</mo><mi>V</mi><mo>→</mo><mo stretchy=\"false\">{</mo><mn>0</mn><mo>,</mo><mn>1</mn><mo>,</mo><mn>2</mn><mo>,</mo><mn>3</mn><mo stretchy=\"false\">}</mo></math></span><span></span>, let <span><math altimg=\"eq-00003.gif\" display=\"inline\" overflow=\"scroll\"><msub><mrow><mi>V</mi></mrow><mrow><mi>i</mi></mrow></msub><mo>=</mo><mo stretchy=\"false\">{</mo><mi>v</mi><mo>∈</mo><mi>V</mi><mo>:</mo><mi>h</mi><mo stretchy=\"false\">(</mo><mi>v</mi><mo stretchy=\"false\">)</mo><mo>=</mo><mi>i</mi><mo stretchy=\"false\">}</mo></math></span><span></span>, <span><math altimg=\"eq-00004.gif\" display=\"inline\" overflow=\"scroll\"><mn>0</mn><mo>≤</mo><mi>i</mi><mo>≤</mo><mn>3</mn></math></span><span></span>. The function <span><math altimg=\"eq-00005.gif\" display=\"inline\" overflow=\"scroll\"><mi>h</mi></math></span><span></span> is called an outer-independent double Roman dominating function (OIDRDF) if the following conditions are satisfied.</p><table border=\"0\" list-type=\"order\" width=\"95%\"><tr><td valign=\"top\">⁽ⁱ⁾</td><td colspan=\"5\" valign=\"top\"><p>If <span><math altimg=\"eq-00006.gif\" display=\"inline\" overflow=\"scroll\"><mi>v</mi><mo>∈</mo><msub><mrow><mi>V</mi></mrow><mrow><mn>0</mn></mrow></msub></math></span><span></span>, then <span><math altimg=\"eq-00007.gif\" display=\"inline\" overflow=\"scroll\"><mo>|</mo><mi>N</mi><mo stretchy=\"false\">(</mo><mi>v</mi><mo stretchy=\"false\">)</mo><mo stretchy=\"false\">∩</mo><msub><mrow><mi>V</mi></mrow><mrow><mn>3</mn></mrow></msub><mo>|</mo><mo>≥</mo><mn>1</mn></math></span><span></span> or <span><math altimg=\"eq-00008.gif\" display=\"inline\" overflow=\"scroll\"><mo>|</mo><mi>N</mi><mo stretchy=\"false\">(</mo><mi>v</mi><mo stretchy=\"false\">)</mo><mo stretchy=\"false\">∩</mo><msub><mrow><mi>V</mi></mrow><mrow><mn>2</mn></mrow></msub><mo>|</mo><mo>≥</mo><mn>2</mn></math></span><span></span></p></td></tr><tr><td valign=\"top\">⁽ⁱⁱ⁾</td><td colspan=\"5\" valign=\"top\"><p>If <span><math altimg=\"eq-00009.gif\" display=\"inline\" overflow=\"scroll\"><mi>v</mi><mo>∈</mo><msub><mrow><mi>V</mi></mrow><mrow><mn>1</mn></mrow></msub></math></span><span></span>, then <span><math altimg=\"eq-00010.gif\" display=\"inline\" overflow=\"scroll\"><mo>|</mo><mi>N</mi><mo stretchy=\"false\">(</mo><mi>v</mi><mo stretchy=\"false\">)</mo><mo stretchy=\"false\">∩</mo><mo stretchy=\"false\">(</mo><msub><mrow><mi>V</mi></mrow><mrow><mn>2</mn></mrow></msub><mo stretchy=\"false\">∪</mo><msub><mrow><mi>V</mi></mrow><mrow><mn>3</mn></mrow></msub><mo stretchy=\"false\">)</mo><mo>|</mo><mo>≥</mo><mn>1</mn></math></span><span></span></p></td></tr><tr><td valign=\"top\">⁽ⁱⁱⁱ⁾</td><td colspan=\"5\" valign=\"top\"><p><span><math altimg=\"eq-00011.gif\" display=\"inline\" overflow=","PeriodicalId":50323,"journal":{"name":"International Journal of Foundations of Computer Science","volume":null,"pages":null},"PeriodicalIF":0.8,"publicationDate":"2024-03-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"140316560","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 Note of Reliability Analysis of SM-λ in Folded-Crossed Hypercube with Conditional Faults","authors":"Jinjie Ma, Mingzu Zhang, Chenxi Li, Hengji Qiao, Yang Fan","doi":"10.1142/s0129054124500035","DOIUrl":"https://doi.org/10.1142/s0129054124500035","url":null,"abstract":"<p>The fault tolerance of an interconnection network of parallel and distributed systems can be evaluated by various topological parameters of its underlying graph <span><math altimg=\"eq-00003.gif\" display=\"inline\" overflow=\"scroll\"><mi>G</mi></math></span><span></span>, with strong Menger edge connectivity being a vital parameter in this regard. A connected graph <span><math altimg=\"eq-00004.gif\" display=\"inline\" overflow=\"scroll\"><mi>G</mi></math></span><span></span> is called strongly Menger edge connected (SM-<span><math altimg=\"eq-00005.gif\" display=\"inline\" overflow=\"scroll\"><mi>λ</mi></math></span><span></span>) if it connects any pair of vertices <span><math altimg=\"eq-00006.gif\" display=\"inline\" overflow=\"scroll\"><mi>u</mi></math></span><span></span> and <span><math altimg=\"eq-00007.gif\" display=\"inline\" overflow=\"scroll\"><mi>v</mi></math></span><span></span> with <span><math altimg=\"eq-00008.gif\" display=\"inline\" overflow=\"scroll\"><mo>min</mo><mo stretchy=\"false\">{</mo><msub><mrow><mi>d</mi></mrow><mrow><mi>G</mi></mrow></msub><mo stretchy=\"false\">(</mo><mi>u</mi><mo stretchy=\"false\">)</mo><mo>,</mo><msub><mrow><mi>d</mi></mrow><mrow><mi>G</mi></mrow></msub><mo stretchy=\"false\">(</mo><mi>v</mi><mo stretchy=\"false\">)</mo><mo stretchy=\"false\">}</mo></math></span><span></span> number of edge-disjoint paths. Under the uniform distribution of faults in a large interconnection network, it is improbable that each faulty edge incident to a vertex will occur simultaneously. Thus, <span><math altimg=\"eq-00009.gif\" display=\"inline\" overflow=\"scroll\"><mi>m</mi></math></span><span></span>-strongly Menger edge connected of order <span><math altimg=\"eq-00010.gif\" display=\"inline\" overflow=\"scroll\"><mi>t</mi></math></span><span></span> was introduced in 2018 by He <i>et al.</i> Here, <span><math altimg=\"eq-00011.gif\" display=\"inline\" overflow=\"scroll\"><mi>G</mi></math></span><span></span> is called as <span><math altimg=\"eq-00012.gif\" display=\"inline\" overflow=\"scroll\"><mi>m</mi></math></span><span></span>-strongly Menger edge connected of order <span><math altimg=\"eq-00013.gif\" display=\"inline\" overflow=\"scroll\"><mi>t</mi></math></span><span></span>, if <span><math altimg=\"eq-00014.gif\" display=\"inline\" overflow=\"scroll\"><mi>G</mi><mo stretchy=\"false\">−</mo><mi>F</mi></math></span><span></span> remains SM-<span><math altimg=\"eq-00015.gif\" display=\"inline\" overflow=\"scroll\"><mi>λ</mi></math></span><span></span>, where <span><math altimg=\"eq-00016.gif\" display=\"inline\" overflow=\"scroll\"><mi>F</mi></math></span><span></span> is an arbitrary edge set in a graph <span><math altimg=\"eq-00017.gif\" display=\"inline\" overflow=\"scroll\"><mi>G</mi></math></span><span></span> with <span><math altimg=\"eq-00018.gif\" display=\"inline\" overflow=\"scroll\"><mo>|</mo><mi>F</mi><mo>|</mo><mo>≤</mo><mi>m</mi></math></span><span></span> and the minimum degree of the remaining graph <span><math altimg=\"eq-00019.gif\" display=\"inline\" overflow=\"scroll\"><mi>δ</mi><mo stretchy=\"fal","PeriodicalId":50323,"journal":{"name":"International Journal of Foundations of Computer Science","volume":null,"pages":null},"PeriodicalIF":0.8,"publicationDate":"2024-03-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"140196741","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":"Non-Adaptive and Adaptive Two-Sided Search with Fast Objects","authors":"Alexey Lebedev, Christian Deppe","doi":"10.1142/s0129054124500023","DOIUrl":"https://doi.org/10.1142/s0129054124500023","url":null,"abstract":"<p>In 1946, Koopman introduced a two-sided search model. In this model, a searched object is active and can move, at most, one step after each test. We analyze the model of a combinatorial two-sided search by allowing more moves of the searched object after each test. We give strategies and show that they are optimal. We consider adaptive and non-adaptive strategies. We show the surprising result that with the combinatorial two-sided search on a path graph, the optimal non-adaptive search needs the same number of tests as the corresponding adaptive strategy does. The strategy obtained can also be used as an encoding strategy to sent the position of a moving element through a transmission channel.</p>","PeriodicalId":50323,"journal":{"name":"International Journal of Foundations of Computer Science","volume":null,"pages":null},"PeriodicalIF":0.8,"publicationDate":"2024-02-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"140045330","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 Generalized 3-Connectivity of Exchanged Crossed Cube","authors":"Wantao Ning, Litao Guo","doi":"10.1142/s0129054124500011","DOIUrl":"https://doi.org/10.1142/s0129054124500011","url":null,"abstract":"Let [Formula: see text] be a connected graph, and [Formula: see text] with [Formula: see text]. [Formula: see text] refers to the maximum number [Formula: see text] of edge-disjoint trees [Formula: see text] in [Formula: see text] such that [Formula: see text] for distinct [Formula: see text]. The generalized [Formula: see text]-connectivity of [Formula: see text], denoted by [Formula: see text], is defined as the minimum value of [Formula: see text] over all [Formula: see text] with [Formula: see text]. In fact, [Formula: see text] is exactly the traditional connectivity of [Formula: see text]. Exchanged crossed cube [Formula: see text], a variation of hypercube, has better properties than other variations of hypercube. In this work we obtain that [Formula: see text] with [Formula: see text].","PeriodicalId":50323,"journal":{"name":"International Journal of Foundations of Computer Science","volume":null,"pages":null},"PeriodicalIF":0.8,"publicationDate":"2024-02-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"139862084","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 Generalized 3-Connectivity of Exchanged Crossed Cube","authors":"Wantao Ning, Litao Guo","doi":"10.1142/s0129054124500011","DOIUrl":"https://doi.org/10.1142/s0129054124500011","url":null,"abstract":"Let [Formula: see text] be a connected graph, and [Formula: see text] with [Formula: see text]. [Formula: see text] refers to the maximum number [Formula: see text] of edge-disjoint trees [Formula: see text] in [Formula: see text] such that [Formula: see text] for distinct [Formula: see text]. The generalized [Formula: see text]-connectivity of [Formula: see text], denoted by [Formula: see text], is defined as the minimum value of [Formula: see text] over all [Formula: see text] with [Formula: see text]. In fact, [Formula: see text] is exactly the traditional connectivity of [Formula: see text]. Exchanged crossed cube [Formula: see text], a variation of hypercube, has better properties than other variations of hypercube. In this work we obtain that [Formula: see text] with [Formula: see text].","PeriodicalId":50323,"journal":{"name":"International Journal of Foundations of Computer Science","volume":null,"pages":null},"PeriodicalIF":0.8,"publicationDate":"2024-02-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"139802095","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":"Special Issue — Articles Dedicated to the Memory of Magnus Steinby: Preface","authors":"Zoltán Fülöp, George Rahonis, Kai Salomaa","doi":"10.1142/s0129054123020057","DOIUrl":"https://doi.org/10.1142/s0129054123020057","url":null,"abstract":"","PeriodicalId":50323,"journal":{"name":"International Journal of Foundations of Computer Science","volume":null,"pages":null},"PeriodicalIF":0.8,"publicationDate":"2024-01-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"139627511","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":"Smooth Subsum Search A Heuristic for Practical Integer Factorization","authors":"Markus Hittmeir","doi":"10.1142/s0129054123500296","DOIUrl":"https://doi.org/10.1142/s0129054123500296","url":null,"abstract":"<p>The two currently fastest general-purpose integer factorization algorithms are the Quadratic Sieve and the Number Field Sieve. Both techniques are used to find so-called smooth values of certain polynomials, i.e., values that factor completely over a set of small primes (the factor base). As the names of the methods suggest, a sieving procedure is used for the task of quickly identifying smooth values among the candidates in a certain range. While the Number Field Sieve is asymptotically faster, the Quadratic Sieve is still considered the most efficient factorization technique for numbers up to around 100 digits. In this paper, we challenge the Quadratic Sieve by presenting a novel approach based on representing smoothness candidates as sums that are always divisible by several of the primes in the factor base. The resulting values are generally smaller than those considered in the Quadratic Sieve, increasing the likelihood of them being smooth. Using the fastest implementations of the Self-initializing Quadratic Sieve in Python as benchmarks, a Python implementation of our approach runs consistently 5 to 7 times faster for numbers with 45–100 digits, and around 10 times faster for numbers with 30–40 digits. We discuss several avenues for further improvements and applications of the technique.</p>","PeriodicalId":50323,"journal":{"name":"International Journal of Foundations of Computer Science","volume":null,"pages":null},"PeriodicalIF":0.8,"publicationDate":"2023-12-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"140045282","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 Verifiable Multi-Secret Sharing Scheme Based on ℓ-Intersection Pair of Cyclic Codes","authors":"Md Ajaharul Hossain, Ramakrishna Bandi","doi":"10.1142/s0129054123500284","DOIUrl":"https://doi.org/10.1142/s0129054123500284","url":null,"abstract":"A verifiable multi-secret sharing (VMSS) scheme addresses various security issues, helping in cheating detection and cheater identification. The dimension of the intersection of a given pair of cyclic codes over a finite field [Formula: see text] is represented by [Formula: see text]. In this paper, we propose a VMSS scheme based on an [Formula: see text]-intersection pair of cyclic codes. The proposed scheme is very useful for sharing a large number of secrets. If [Formula: see text] is the number of secrets in a threshold [Formula: see text] scheme, then for [Formula: see text], the computational complexity and the public values required in the reconstruction phase are much less compared to many existing schemes in the literature. Overall, the proposed scheme comprises nearly all the features, like being verifiable, testing participants’ integrity, checking Verifier frauds, and most importantly, it is of multi-use type.","PeriodicalId":50323,"journal":{"name":"International Journal of Foundations of Computer Science","volume":null,"pages":null},"PeriodicalIF":0.8,"publicationDate":"2023-11-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"139209229","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":"Tree-Based Generation of Restricted Graph Languages","authors":"Henrik Björklund, Johanna Björklund, Petter Ericson","doi":"10.1142/s0129054123480106","DOIUrl":"https://doi.org/10.1142/s0129054123480106","url":null,"abstract":"Order-preserving DAG grammars (OPDGs) is a formalism for representing languages of structurally restricted graphs. As demonstrated in [17], they are sufficiently expressive to model abstract meaning representations in natural language processing, a graph-based form of semantic representation in which nodes encode objects and edges relations. At the same time, they can be parsed in [Formula: see text], where [Formula: see text] and [Formula: see text] are the sizes of the grammar and the input graph, respectively. In this work, we provide an initial algebra semantic for OPDGs, which allows us to view them as regular tree grammars under an equivalence theory. This makes it possible to transfer results from the field of formal tree languages to the domain of OPDGs, both in the unweighted and the weighted case. In particular, we show that deterministic OPDGs can be minimised efficiently, and that they are learnable under the “minimal adequeate teacher” paradigm, that is, by querying an oracle for equivalence between languages, and membership of individual graphs. To conclude, we demonstrate that the languages generated by OPDGs are definable in monadic second-order logic.","PeriodicalId":50323,"journal":{"name":"International Journal of Foundations of Computer Science","volume":null,"pages":null},"PeriodicalIF":0.8,"publicationDate":"2023-11-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"139240397","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":"Author Index Volume 34 (2023)","authors":"","doi":"10.1142/s0129054123990010","DOIUrl":"https://doi.org/10.1142/s0129054123990010","url":null,"abstract":"","PeriodicalId":50323,"journal":{"name":"International Journal of Foundations of Computer Science","volume":null,"pages":null},"PeriodicalIF":0.8,"publicationDate":"2023-11-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"139257455","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}