样式: 排序: IF: - GO 导出 标记为已读
-
Edge-Disjoint Hamiltonian Cycles in Balanced Hypercubes with Applications to Fault-Tolerant Data Broadcasting Int. J. Found. Comput. Sci. (IF 0.8) Pub Date : 2024-04-18 Shuai Liu, Yan Wang, Jianxi Fan, Baolei Cheng
The existence of multiple edge-disjoint Hamiltonian cycles (EDHCs for short) is a desirable property of interconnection networks. These parallel cycles can provide an advantage for algorithms that require a ring structure. Additionally, EDHCs can enhance all-to-all data broadcasting and edge fault tolerance in network communications. In this paper, we investigate the construction of EDHCs in the balanced
-
Algorithmic Aspects of Outer-Independent Double Roman Domination in Graphs Int. J. Found. Comput. Sci. (IF 0.8) Pub Date : 2024-03-28 Amit Sharma, P. Venkata Subba Reddy, S. Arumugam, Jakkepalli Pavan Kumar
Let G=(V,E) be graph. For any function h:V→{0,1,2,3}, let Vi={v∈V:h(v)=i}, 0≤i≤3. The function h is called an outer-independent double Roman dominating function (OIDRDF) if the following conditions are satisfied. (i) If v∈V0, then |N(v)∩V3|≥1 or |N(v)∩V2|≥2 (ii) If v∈V1, then |N(v)∩(V2∪V3)|≥1 (iii) V0 is independent. The outer-independent double Roman domination number of G is defined by γoidR(G)=min∑v∈Vh(v):h
-
A Note of Reliability Analysis of SM-λ in Folded-Crossed Hypercube with Conditional Faults Int. J. Found. Comput. Sci. (IF 0.8) Pub Date : 2024-03-19 Jinjie Ma, Mingzu Zhang, Chenxi Li, Hengji Qiao, Yang Fan
The fault tolerance of an interconnection network of parallel and distributed systems can be evaluated by various topological parameters of its underlying graph G, with strong Menger edge connectivity being a vital parameter in this regard. A connected graph G is called strongly Menger edge connected (SM-λ) if it connects any pair of vertices u and v with min{dG(u),dG(v)} number of edge-disjoint paths
-
Non-Adaptive and Adaptive Two-Sided Search with Fast Objects Int. J. Found. Comput. Sci. (IF 0.8) Pub Date : 2024-02-29 Alexey Lebedev, Christian Deppe
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
-
The Generalized 3-Connectivity of Exchanged Crossed Cube Int. J. Found. Comput. Sci. (IF 0.8) Pub Date : 2024-02-06 Wantao Ning, Litao Guo
Let G be a connected graph, and S⊆V(G) with |S|≥2. κG(S) refers to the maximum number k of edge-disjoint trees T1,T2,…,Tk in G such that V(Ti)∩V(Tj)=S for distinct i,j∈{1,2,…,k}. The generalized k-connectivity of G, denoted by κk(G), is defined as the minimum value of κG(S) over all S⊆V(G) with |S|=k. In fact, κ2(G) is exactly the traditional connectivity of G. Exchanged crossed cube ECQ(s,t), a variation
-
Smooth Subsum Search A Heuristic for Practical Integer Factorization Int. J. Found. Comput. Sci. (IF 0.8) Pub Date : 2023-12-29 Markus Hittmeir
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
-
A Verifiable Multi-Secret Sharing Scheme Based on ℓ-Intersection Pair of Cyclic Codes Int. J. Found. Comput. Sci. (IF 0.8) Pub Date : 2023-11-29 Md Ajaharul Hossain, Ramakrishna Bandi
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 𝔽q is represented by ℓ. In this paper, we propose a VMSS scheme based on an ℓ-intersection pair of cyclic codes. The proposed scheme is very useful for sharing a large number
-
Tree-Based Generation of Restricted Graph Languages Int. J. Found. Comput. Sci. (IF 0.8) Pub Date : 2023-11-24 Henrik Björklund, Johanna Björklund, Petter Ericson
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 𝒪(n2+nm), where
-
Weighted Linear Dynamic Logic Int. J. Found. Comput. Sci. (IF 0.8) Pub Date : 2023-11-16 Manfred Droste, Gustav Grabolle, George Rahonis
We introduce a weighted linear dynamic logic (weighted LDL for short) and show the expressive equivalence of its formulas to weighted rational expressions. This adds a new characterization for recognizable series to the fundamental Schützenberger theorem. Surprisingly, the equivalence does not require any restriction to our weighted LDL. Our results hold over arbitrary (resp. totally complete) semirings
-
Approximating Minimum k-Tree Cover of a Connected Graph Inspired by the Multi-Ferry Routing in Delay Tolerant Networks Int. J. Found. Comput. Sci. (IF 0.8) Pub Date : 2023-11-16 Fujita Satoshi
In this paper, we consider the problem of covering the vertex set of a given graph by k trees so as to minimize the maximum weight of the trees, as a subproblem of the multi-ferry scheduling problem proposed by Zhao and Ammar. After pointing out that the approximation ratio of a greedy scheme based on the Kruskal’s algorithm is provably bad, we show that the approximation ratio cannot be better than
-
Synthesizing Computable Functions from Rational Specifications Over Infinite Words Int. J. Found. Comput. Sci. (IF 0.8) Pub Date : 2023-11-15 Emmanuel Filiot, Sarah Winter
The synthesis problem asks to automatically generate, if it exists, an algorithm from a specification of correct input-output pairs. In this paper, we consider the synthesis of computable functions of infinite words, for a classical Turing computability notion over infinite inputs. We consider specifications which are rational relations of infinite words, i.e., specifications defined by non-deterministic
-
Rainbow Domination in Cartesian Product of Paths and Cycles Int. J. Found. Comput. Sci. (IF 0.8) Pub Date : 2023-11-11 Hong Gao, Yunlei Zhang, Yuqi Wang, Yuanyuan Guo, Xing Liu, Renbang Liu, Changqing Xi, Yuansheng Yang
Let G=(V,E) be a graph and k be an integer representing k colors. There is a function f from V to the power set of k colors satisfying every vertex v∈V assigned ∅ under f in its neighborhood has all the colors, then f is called a k-rainbow dominating function (kRDF) on G. The weight of f is the sum of the number of colors on each vertex all over the graph. The k-rainbow domination number of G is the
-
Quantum and Approximation Algorithms for Maximum Witnesses of Boolean Matrix Products Int. J. Found. Comput. Sci. (IF 0.8) Pub Date : 2023-11-10 Mirosław Kowaluk, Andrzej Lingas
The problem of finding maximum (or minimum) witnesses of the Boolean product of two Boolean matrices (MW for short) has a number of important applications, in particular the all-pairs lowest common ancestor (LCA) problem in directed acyclic graphs (dags). The best known upper time-bound on the MW problem for n×n Boolean matrices of the form O(n2.575) has not been substantially improved since 2006.
-
Total 2-Rainbow Domination in Graphs: Complexity and Algorithms Int. J. Found. Comput. Sci. (IF 0.8) Pub Date : 2023-10-28 Manjay Kumar, P. Venkata Subba Reddy
For a simple, undirected graph G(V,E) without isolated vertices, a function h:V→{ϕ,{1},{2},{1,2}} which satisfies the following two conditions is called a total 2-rainbow dominating function (T2RDF) of G. (i) For all u∈V, if h(u)=ϕ then ∪v∈N(u)h(v)={1,2} and (ii) Every u∈V with h(u)≠ϕ is adjacent to a vertex v with h(v)≠ϕ. The weight of a T2RDF h of G is the value h(V)=∑u∈V|h(u)|. The total 2-rainbow
-
Connectivity Status of Intuitionistic Fuzzy Graphs and Its Applications Int. J. Found. Comput. Sci. (IF 0.8) Pub Date : 2023-10-19 Zengtai Gong, Lele He
The connectivity is one of the crucial parameters of network used to transport network flow, routing problems and bandwidth allocation problems. The increased connectivity makes a network more stable. In this paper, a new parameter called connectivity status of a vertex is introduced in the intuitionistic fuzzy graph. The related definitions and propositions of connectivity status of a vertex are proposed
-
Algorithmic Aspects of Total Vertex-Edge Domination in Graphs Int. J. Found. Comput. Sci. (IF 0.8) Pub Date : 2023-10-19 H. Naresh Kumar, Mustapha Chellali, Y. B. Venkatakrishnan
A vertex v of a simple graph G=(V,E)ve-dominates every edge incident to v as well as every edge adjacent to these incident edges. A set D⊆V is a total vertex-edge dominating set if every edge of E is ve-dominated by a vertex of D and the subgraph induced by D has no isolated vertex. The total vertex-edge domination problem is to find a total vertex-edge dominating set of minimum cardinality. In this
-
Relating Various Types of Distributed Reaction Systems Int. J. Found. Comput. Sci. (IF 0.8) Pub Date : 2023-10-18 Bogdan Aman
A distributed reaction system models a system composed of several reaction systems. Each reaction system has its own set of reactions, while the background set is the same for all reaction systems. At each transition of the distributed reaction system, the environment provides an arbitrary context containing symbols for each reaction system and also it specifies which reaction systems are active. On
-
Binary Generalized PCP for Two Periodic Morphisms is Decidable in Polynomial Time Int. J. Found. Comput. Sci. (IF 0.8) Pub Date : 2023-10-16 Vesa Halava, Štěpán Holub
We show that the binary generalized Post’s Correspondence Problem is decidable in polynomial time for the case where both morphisms are periodic. Our result is based on combinatorial properties and we have formalized the proofs and verified correctness of our algorithm using the Isabelle/HOL formal proof system.
-
Improved Linear-Time Streaming Algorithms for Maximizing Monotone Cardinality-Constrained Set Functions Int. J. Found. Comput. Sci. (IF 0.8) Pub Date : 2023-10-05 Min Cui, Donglei Du, Ling Gai, Ruiqi Yang
Many real-world applications arising from social networks, personalized recommendations, and others, require extracting a relatively small but broadly representative portion of massive data sets. Such problems can often be formulated as maximizing a monotone set function with cardinality constraints. In this paper, we consider a streaming model where elements arrive quickly over time, and create an
-
Compositions of Weighted Extended Tree Transducers — The Unambiguous Case Int. J. Found. Comput. Sci. (IF 0.8) Pub Date : 2023-09-29 Andreas Maletti
Generalizations of another two open conjectures, Conjectures 13 and 14, of [Lagoutte, Maletti: Survey — Weighted extended top-down tree transducers — Part III: Composition. Proc. AFCS, LNCS 7020, p. 272–308, Springer 2011] are verified. It is proved that the composition of an unambiguous weighted extended tree transducer M with a nondeleting weighted top-down tree transducer N can be computed by a
-
A Formal Verification of a SAT Solution by P Systems with Evolution Communication and Separation Rules Int. J. Found. Comput. Sci. (IF 0.8) Pub Date : 2023-09-29 David Orellana-Martín, Luis Valencia-Cabrera, Mario J. Pérez-Jiménez
In the framework of membrane computing, several interesting results concerning frontiers of efficiency between the complexity classes P and NP have been found by using different ingredients. One of the main characteristics of cell-like membrane systems is their rooted tree-like structure, where a natural parent-children membrane relationship exists, and objects can travel through the membranes. Separation
-
Parameterized Algorithms for Fixed-Order Book Drawing with Few Crossings Per Edge Int. J. Found. Comput. Sci. (IF 0.8) Pub Date : 2023-09-29 Jingui Huang, Jie Chen, Yunlong Liu, Guang Xiao, Jianxin Wang
Given an n-vertex graph G with a fixed linear ordering of V(G) and two integers k,b, the problem fixed-order book drawing with few crossings per edge asks whether or not G admits a k-page book drawing where the maximum number of crossings per edge can be upper bounded by the number b. This problem was posed as an open question by Bhore et al. (J. Graph Algorithms Appl. 2020). In this paper, we study
-
On the Super (Edge)-Connectivity of Generalized Johnson Graphs Int. J. Found. Comput. Sci. (IF 0.8) Pub Date : 2023-09-27 Zhecheng Yu, Liqiong Xu, Xuemin Wu, Chuanye Zheng
Let n, k and t be non-negative integers. The generalized Johnson graph G(n,k,t) is the graph whose vertices are the k-subsets of the set {1,2,…,n}, and two vertices are adjacent if and only if they intersect with t elements. Special cases of generalized Johnson graph include the Kneser graph G(n,k,0) and the Johnson graph G(n,k,k−1). These graphs play an important role in coding theory, Ramsey theory
-
Two New Classes of (Almost) Perfect c-Nonlinear Permutations Int. J. Found. Comput. Sci. (IF 0.8) Pub Date : 2023-09-27 Zhenghua Xu, Lijing Zheng, Chonghui Huang
In this short note, we present two classes of (almost) perfect c-nonlinear permutations over finite fields of even characteristic.
-
Inverse Spectral Problems for a Special Acyclic Matrix Int. J. Found. Comput. Sci. (IF 0.8) Pub Date : 2023-09-25 Qifang Su
In this paper, we consider the reconstruction of matrices whose graph is a star with root at the central vertex from given partial eigen data. Three inverse spectral problems are discussed. The necessary and sufficient conditions for the solvability of the problems are studied. Furthermore, the corresponding numerical algorithms are presented. Some numerical examples are also provided to demonstrate
-
Vertex and Link Residual Closeness of Graphs of Given Fractional Matching Number Int. J. Found. Comput. Sci. (IF 0.8) Pub Date : 2023-09-09 Hui Dong
Vertex and link residual closeness are two new measures of network vulnerability due to the failure of individual vertices and links, respectively. We identify those graphs with maximum vertex/link residual closeness over all n-vertex connected graphs with fixed fractional matching number.
-
On the Span of ℓ Distance Coloring of Infinite Hexagonal Grid Int. J. Found. Comput. Sci. (IF 0.8) Pub Date : 2023-09-08 Subhasis Koley, Sasthi C. Ghosh
For a graph G(V,E) and ℓ∈ℕ, an ℓ distance coloring is a coloring f:V→{1,2,…,t} of V with t colors such that ∀u,v∈V,u≠v,f(u)≠f(v) when d(u,v)≤ℓ. Here d(u,v) is the distance between u and v and is equal to the minimum number of edges that connect u and v in G. The span of ℓ distance coloring of G, χℓ(G), is the minimum t among all ℓ distance coloring of G. A class of channel assignment problem in cellular
-
Approximating All-Points Furthest Pairs and Maximum Spanning Trees in Metric Spaces Int. J. Found. Comput. Sci. (IF 0.8) Pub Date : 2023-09-07 Ching-Lueh Chang, Chun-Wei Chang
Consider the problem of finding a point furthest from x for each point x in a metric space ([n],d), where [n]={1,2,…,n}. We prove this problem to have a deterministic O(n)-time 1/3-approximation algorithm. As a corollary, the maximum spanning tree problem in metric spaces has a deterministic O(n)-time 1/3-approximation algorithm. We also give a Monte Carlo O(n1.5logn)-time algorithm outputting, for
-
A Recursive Algorithm for Constructing Dual-CISTs in Hierarchical Folded Cubic Networks Int. J. Found. Comput. Sci. (IF 0.8) Pub Date : 2023-08-29 Hsin-Jung Lin, Shyue-Ming Tang, Kung-Jui Pai, Jou-Ming Chang
Let 𝒯={T1,T2,…,Tk} be a set of k≥2 spanning trees in a graph G. The k spanning trees are called completely independent spanning trees (CISTs for short) if the paths joining every pair of vertices x and y in any two trees have neither vertex nor edge in common except for x and y. Particularly, 𝒯 is called a dual-CIST provided k=2. For data transmission applications in reliable networks, the existence
-
Algorithms for the Truss Maintenance Problem on Edge-Weighted Graphs Int. J. Found. Comput. Sci. (IF 0.8) Pub Date : 2023-08-01 Bin Liu, Zhenming Liu, Feiteng Zhang
The k-truss was proposed by Jonathan Cohen in 2008, and it is a widely used as index in graph analysis for cohesive subgraph mining. There are two basic problems in this area. One is the truss decomposition problem, which is to compute the truss number of every edge; the other is the truss maintenance problem, which is to update the truss numbers of the affected edges in a dynamic graph while avoiding
-
PSPACE-Completeness of Reversible Deterministic Systems Int. J. Found. Comput. Sci. (IF 0.8) Pub Date : 2023-07-29 Erik D. Demaine, Robert A. Hearn, Dylan Hendrickson, Jayson Lynch
We prove PSPACE-completeness of several reversible, fully deterministic systems. At the core, we develop a framework for such proofs (building on a result of Tsukiji and Hagiwara and a framework for motion planning through gadgets), showing that any system that can implement three basic gadgets is PSPACE-complete. We then apply this framework to four different systems, showing its versatility. First
-
Decidability Boundaries for the Finite-Image Property of Weighted Finite Automata Int. J. Found. Comput. Sci. (IF 0.8) Pub Date : 2023-07-25 Manfred Droste, Zoltán Fülöp, Dávid Kószó
A weighted finite automaton has the finite-image property if the image of the weighted language associated with it is finite. We show two undecidability results concerning the finite-image property of weighted finite automata over semirings, respectively strong bimonoids. Firstly, we give a computable idempotent commutative past-finite ordered semiring such that it is undecidable, for an arbitrary
-
Online Predictions for Online TSP on the Line Int. J. Found. Comput. Sci. (IF 0.8) Pub Date : 2023-07-25 Jian-Xi Shao, Ya-Chun Liang, Chung-Shou Liao
With a rapidly growing attention on the development of learning-augmented algorithms, we revisit the classical online traveling salesman problem (OLTSP) from the perspective of such learning approaches. A learning-augmented online algorithm, or simply an online algorithm with predictions, considers how to improve its competitive performance with theoretical guarantees by forecasting the information
-
Effective Projections on Group Shifts to Decide Properties of Group Cellular Automata Int. J. Found. Comput. Sci. (IF 0.8) Pub Date : 2023-07-19 Pierre Béaur, Jarkko Kari
Many decision problems concerning cellular automata are known to be decidable in the case of algebraic cellular automata, that is, when the state set has an algebraic structure and the automaton acts as a morphism. The most studied cases include finite fields, finite commutative rings and finite commutative groups. In this paper, we provide methods to generalize these results to the broader case of
-
Completely Reachable Automata: An Interplay Between Automata, Graphs, and Trees Int. J. Found. Comput. Sci. (IF 0.8) Pub Date : 2023-07-14 Eugenija A. Bondar, David Casas, Mikhail V. Volkov
A deterministic finite automaton in which every non-empty set of states occurs as the image of the whole state set under the action of a suitable input word is called completely reachable. We characterize such automata in terms of graphs and trees.
-
A Comparison of Sets of Recognizable Weighted Tree Languages Over Specific Sets of Bounded Lattices Int. J. Found. Comput. Sci. (IF 0.8) Pub Date : 2023-07-17 Zoltán Fülöp, Heiko Vogler
We consider weighted tree automata (wta) over bounded lattices, locally finite bounded lattices, distributive bounded lattices, and finite chains and we consider the weighted tree languages defined by their run semantics and by their initial algebra semantics. Due to these eight combinations, there are eight sets of weighted tree languages. Moreover, we consider the four sets of weighted tree languages
-
A Note on Squares in Binary Words Int. J. Found. Comput. Sci. (IF 0.8) Pub Date : 2023-07-12 Tero Harju
We consider words over a binary alphabet. A word w is overlap-free if it does not have factors (blocks of consecutive letters) of the form uvuvu for nonempty u. Let M(w) denote the number of positions that are middle positions of squares (of the form uu) in w. We show that for overlap-free binary words, 2M(w)≤|w|+3, and that there are infinitely many overlap-free binary words for which 2M(w)=|w|+3
-
Fuzzy Propositional Configuration Logics Int. J. Found. Comput. Sci. (IF 0.8) Pub Date : 2023-07-10 Paulina Paraponiari
We introduce and investigate a weighted propositional configuration logic over De Morgan algebras. This logic is able to describe software architectures with quantitative features especially the uncertainty of the interactions that occur in the architecture. We deal with the equivalence problem of formulas in our logic by showing that every formula can be written in a specific form. Surprisingly, there
-
Language Classes of Extended Distributed Reaction Systems Int. J. Found. Comput. Sci. (IF 0.8) Pub Date : 2023-07-04 Lucie Ciencialová, Luděk Cienciala, Erzsébet Csuhaj-Varjú
Reaction systems are well-known formal models of interactions between biochemical reactions. A reaction system is a finite set of triples (reactants, inhibitors, products) that represent chemical reactions, where the reactants, the inhibitors, and the products are objects corresponding to the chemicals. The reactions may facilitate or inhibit each other. A distributed reaction system consists of a
-
Marriage and Roommate Int. J. Found. Comput. Sci. (IF 0.8) Pub Date : 2023-06-30 Kazuo Iwama, Shuichi Miyazaki
This paper has two objectives. One is to give a linear time algorithm that solves the stable roommates problem (i.e., obtains one stable matching) using the stable marriage problem. The idea is that a stable matching of a roommate instance I is a stable matching (that however must satisfy a certain condition) of some marriage instance I′. I′ is obtained just by making two copies of I, one for the men’s
-
Hardness Results of Connected Power Domination for Bipartite Graphs and Chordal Graphs Int. J. Found. Comput. Sci. (IF 0.8) Pub Date : 2023-06-28 Pooja Goyal, B. S. Panda
A set D⊆V of a graph G=(V,E) is called a connected power dominating set of G if G[D], the subgraph induced by D, is connected and every vertex in the graph can be observed from D, following the two observation rules for power system monitoring: Rule 1: if v∈D, then v can observe itself and all its neighbors, and Rule 2: for an already observed vertex whose all neighbors except one are observed, then
-
Approximation Algorithms for Partial Vertex Covers in Trees Int. J. Found. Comput. Sci. (IF 0.8) Pub Date : 2023-06-28 Vahan Mkrtchyan, Ojas Parekh, K. Subramani
This paper is concerned with designing algorithms for and analyzing the computational complexity of the partial vertex cover problem in trees. Graphs (and trees) are frequently used to model risk management in various systems. In particular, Caskurlu et al. in [4] have considered a system which essentially represents a tripartite graph. The goal in this model is to reduce the risk in the system below
-
Robust Subgroup Multisignature with One-Time Public Keys in Order Int. J. Found. Comput. Sci. (IF 0.8) Pub Date : 2023-06-28 Zhiwei Wang, Chen Tian, Zhanlin Wang, Yuhang Wang
Robust subgroup multisignature allows any subgroup of signers from a global set to sign a given message on behalf of the whole group, and the individual signatures should be verified before the combination process, which resists poison signature attacks. An emerging application of robust subgroup multisignatures in blockchain is that a qualified subgroup of a global set of users has reached agreement
-
On the Boolean Closure of Deterministic Top-Down Tree Automata Int. J. Found. Comput. Sci. (IF 0.8) Pub Date : 2023-06-28 Christof Löding, Wolfgang Thomas
The class of Boolean combinations of tree languages recognized by deterministic top-down tree automata (also known as deterministic root-to-frontier automata) is studied. The problem of determining for a given regular tree language whether it belongs to this class is open. We provide some progress by two results: First, a characterization of this class by a natural extension of deterministic top-down
-
Minimizing Maximum Unmet Demand by Transportations Between Adjacent Nodes Characterized by Supplies and Demands Int. J. Found. Comput. Sci. (IF 0.8) Pub Date : 2023-06-23 Tetsuo Asano
Suppose we are given a graph with nodes characterized by amounts of supplies and demands of multiple commodities. The amounts of commodities stored at nodes (supplies) are given by positive numbers while those of demands at nodes are given by negative numbers. To meet demands we send commodities from nodes to neighbors by using vehicles, one at each node, with some loading capacity moving to and from
-
The Wide Diameter and Fault Diameter of Exchanged Crossed Cube Int. J. Found. Comput. Sci. (IF 0.8) Pub Date : 2023-06-23 Baohua Niu, Shuming Zhou, Tao Tian, Qifan Zhang
The fault diameter and wide diameter are commonly used to measure the fault tolerance and transmission delay of interconnection networks beyond traditional diameter. The α-wide diameter of graph G, denoted by Dα(G), is the minimum integer l such that there exist at least α internally vertex disjoint paths of length at most l for any two distinct vertices in G. The β-fault diameter of graph G, denoted
-
The Structure Fault Tolerance of Alternating Group Networks Int. J. Found. Comput. Sci. (IF 0.8) Pub Date : 2023-06-23 Huifen Ge, Shumin Zhang, Chengfu Ye
The alternating group network ANn can be used to model the topology structure of a large-scale parallel network system. In this work, the structure fault tolerance of alternating group networks based on the star and path structures is investigated. For a graph G and its a connected subgraph H, the H-structure connectivity κ(G;H) (resp. H-substructure connectivity κs(G;H)) of G is the cardinality of
-
On Two Modifications of the McEliece PKE and the CFS Signature Scheme Int. J. Found. Comput. Sci. (IF 0.8) Pub Date : 2023-06-23 Giuseppe D’Alconzo
This paper analyzes two schemes from a 2019 work by Liu, Yang, Han and Wang, namely, adapting the McEliece cryptosystem to obtain a new public-key encryption scheme, and designing an efficient CFS-like digital signature. It is shown that the new encryption scheme based on McEliece, even if it has longer public keys, is not more secure than the standard one. The security gap between the original scheme
-
Family Trees for Enumeration Int. J. Found. Comput. Sci. (IF 0.8) Pub Date : 2023-06-16 Shin-Ichi Nakano
In this paper we design efficient algorithms for enumerating (1) the rooted trees with exactly n vertices, (2) the maximal planar graphs with exactly n vertices and (3) the linear extensions of a given poset. Those algorithms are based on tree structures of objects, called the family trees. The first algorithm enumerates each ordered tree with exactly n vertices in O(1) time for each after O(n) time
-
Equivalence, Unambiguity, and Sequentiality of Finitely Ambiguous Max-Plus Tree Automata Int. J. Found. Comput. Sci. (IF 0.8) Pub Date : 2023-06-17 Erik Paul
We show that the equivalence, unambiguity, and sequentiality problems are decidable for finitely ambiguous max-plus tree automata. A max-plus tree automaton is a weighted tree automaton over the max-plus semiring. A max-plus tree automaton is called finitely ambiguous if the number of accepting runs on every tree is bounded by a global constant and it is called unambiguous if there exists at most one
-
A Simple and Efficient Method for Accelerating Construction of the Gap-Greedy Spanner Int. J. Found. Comput. Sci. (IF 0.8) Pub Date : 2023-06-09 Hosein Salami, Mostafa Nouri-Baygi
Let G be the complete Euclidean graph on a set of points embedded in the plane. Given a constant t>1, a spanning subgraph G′ of G is said to be a t-spanner, or simply a spanner, if for any pair of nodes p, q in G there exists a t-path in G′, i.e., a path between p and q whose length is at most t times their distance in G. Gap-greedy spanner, proposed by Arya and Smid, is a light weight and bounded
-
Reconfiguration of Hamiltonian Cycles in Rectangular Grid Graphs Int. J. Found. Comput. Sci. (IF 0.8) Pub Date : 2023-05-31 Rahnuma Islam Nishat, Sue Whitesides
We study reconfiguration of simple Hamiltonian cycles in a rectangular grid graph G, where the Hamiltonian cycle in each step of the reconfiguration connects every internal vertex of G to a boundary vertex by a single straight line segment. We introduce two operations, flip and transpose, which are local to the grid. We show that any simple cycle of G can be reconfigured to any other simple cycle of
-
A Simple 2-Approximation for Maximum-Leaf Spanning Tree Int. J. Found. Comput. Sci. (IF 0.8) Pub Date : 2023-05-29 I-Cheng Liao, Hsueh-I Lu
For an m-edge connected simple graph G, finding a spanning tree of G with the maximum number of leaves is MAXSNP-complete. The problem remains NP-complete even if G is planar and the maximal degree of G is at most four. Lu and Ravi gave the first known polynomial-time approximation algorithms with approximation factors 5 and 3. Later, they obtained a 3-approximation algorithm that runs in near-linear
-
Shortest Journeys in Directed Temporal Graphs Int. J. Found. Comput. Sci. (IF 0.8) Pub Date : 2023-05-23 Siu-Wing Cheng
Consider a directed temporal graph G=(V,E) with time ranges on the edges. There can be more than one range on an edge, and each range carries a positive traversal time. Let n=|V| and let Δ be the total number of time ranges in G. We assume that Δ=Ω(n). We study the problem of computing shortest journeys that start from a fixed source vertex s within a given time interval [tb,te), where the cost of
-
k-Planar Placement and Packing of Δ-Regular Caterpillars Int. J. Found. Comput. Sci. (IF 0.8) Pub Date : 2023-05-22 Carla Binucci, Emilio Di Giacomo, Michael Kaufmann, Giuseppe Liotta, Alessandra Tappini
This paper studies a packing problem in the so-called beyond-planar setting, that is when the host graph is “almost-planar” in some sense. Precisely, we consider the case that the host graph is k-planar, i.e., it admits an embedding with at most k crossings per edge, and focus on families of Δ-regular caterpillars, that are caterpillars whose non-leaf vertices have the same degree Δ. We study the dependency
-
Modelling Uncertainty in Architectures of Parametric Component-Based Systems Int. J. Found. Comput. Sci. (IF 0.8) Pub Date : 2023-05-22 Maria Pittou, George Rahonis
In this paper, we propose a logic-based characterization of uncertainty in architectures of parametric component-based systems, where the parameter is the number of instances of each component type. For this, we firstly introduce an extended propositional interaction logic over De Morgan algebras and we show that its formulas can encode the uncertainty of several architectures applied in systems with
-
Embedding Augmented Cube into Certain Trees and Windmill Graphs Int. J. Found. Comput. Sci. (IF 0.8) Pub Date : 2023-05-20 A. Berin Greeni, R. Sundara Rajan, Paul Immanuel
The technique used in studying the computational capabilities of interconnection networks and task distribution is graph embedding. Based on the recursively constructed graphs, the hypercube network is popular for its structure. Many variants of hypercube are considered in the literature. Augmented cube is considered as one of the best variants of hypercube as it holds many desirable properties like
-
Vertex-Bipartition: A Unified Approach for Kernelization of Graph Linear Layout Problems Parameterized by Vertex Cover Int. J. Found. Comput. Sci. (IF 0.8) Pub Date : 2023-05-09 Yunlong Liu, Yixuan Li, Jingui Huang
The linear layout of graphs problem asks, given a graph G and a positive integer k, whether G admits a layout consisting of a linear ordering of its vertices and a partition of its edges into k sets such that the edges in each set meet some special requirements. Specific linear layouts include k-stack layout, k-queue layout, k-arch layout, mixed s-stack q-queue layout and others. In this paper, we
-
On the Shared Transportation Problem: Computational Hardness and Exact Approach Int. J. Found. Comput. Sci. (IF 0.8) Pub Date : 2023-05-09 Tom Davot, Rodolphe Giroudeau, Jean-Claude König
In our modern societies, a certain number of people do not own a car, by choice or by obligation. For some trips, there is no or few alternatives to the car. One way to make these trips possible for these people is to be transported by others who have already planned their trips. We propose to model this problem using as path-finding problem in a list edge-colored graph. This problem is a generalization
-
Drawing Simultaneously Embedded Graphs with Few Bends Int. J. Found. Comput. Sci. (IF 0.8) Pub Date : 2023-05-09 Luca Grilli, Seok-Hee Hong, Jan Kratochvíl, Ignaz Rutter
We study the problem of drawing simultaneously embedded graphs with few bends. We show that for any simultaneous embedding with fixed edges (Sefe) of two graphs, there exists a corresponding drawing realizing this embedding such that common edges are drawn as straight-line segments and each exclusive edge has a constant number of bends. If the common graph is biconnected and induced, a straight-line