-
A hybrid modified PSO algorithm for the inverse p-median location problem in fuzzy random environment Theor. Comput. Sci. (IF 1.1) Pub Date : 2024-04-16 Sepideh Taghikhani, Fahimeh Baroughi, Behrooz Alizadeh
This paper considers the inverse -median location problem with variable edge lengths and variable vertex weights on general graphs in which the modification costs are the fuzzy random variables. We present a model for the problem in fuzzy random environment in which the objective value is computed by conditional value at risk criterion. Then, we show that the problem is NP-hard under this criterion
-
Priority queues with decreasing keys Theor. Comput. Sci. (IF 1.1) Pub Date : 2024-04-16 Gerth Stølting Brodal
A priority queue stores a multiset of items, each item being a pair, and supports the insertion of a new item and extraction of an item with minimum key. In applications like Dijkstra's single source shortest path algorithm and Prim-Jarník's minimum spanning tree algorithm, the key of an item can decrease over time. Usually this is handled by either using a priority queue supporting the deletion of
-
Set-to-set disjoint paths in a folded hypercube Theor. Comput. Sci. (IF 1.1) Pub Date : 2024-04-16 Hiroyuki Ichida, Keiichi Kaneko
The hypercube is a very popular topology for the interconnection networks of parallel systems, and the folded hypercube is a variant of the hypercube. The folded hypercube attains much higher performance by introducing one additional link to each processing element. Therefore, there are many research activities regarding the folded hypercube. We focus on this topology and address an unresolved problem
-
Biometric-based two-factor authentication scheme under database leakage Theor. Comput. Sci. (IF 1.1) Pub Date : 2024-04-08 Mingming Jiang, Shengli Liu, Shuai Han, Dawu Gu
A Two-Factor Authentication (2FA) scheme can authenticate a client if the client is able to provide the possession factor (like biometric feature, smart card) and the knowledge factor (like password, secret key) simultaneously. With only one factor, it is hard for an adversary to impersonate the client to pass the authentication, and thus 2FA provides better security than single-factor authentication
-
Partial prime factor exposure attacks on some RSA variants Theor. Comput. Sci. (IF 1.1) Pub Date : 2024-04-03 Yansong Feng, Abderrahmane Nitaj, Yanbin Pan
In this paper, we consider five variants of the RSA cryptosystem, where the modulus is , and the public key and the secret key satisfy or . Our results show that if a certain amount of the most significant bits of are known so that with a known , then one can factor the RSA modulus with a better bound than low private exponent attacks. We also present the experimental results to verify our analysis
-
Upward planarity testing of biconnected outerplanar DAGs solves partition Theor. Comput. Sci. (IF 1.1) Pub Date : 2024-04-02 Fabrizio Frati
We show an -time reduction from the problem of testing whether a multiset of positive integers can be partitioned into two multisets so that the sum of the integers in each multiset is equal to to the problem of testing whether an -vertex biconnected outerplanar DAG admits an upward planar drawing. This constitutes the first barrier to the existence of efficient algorithms for testing the upward planarity
-
Rational power series in several noncommuting variables and the Skolem–Mahler–Lech theorem Theor. Comput. Sci. (IF 1.1) Pub Date : 2024-04-02 Juha Honkala
We generalize the Skolem–Mahler–Lech theorem for rational power series in several noncommuting variables having a slender support. This generalization gives a connection between the Skolem–Mahler–Lech theorem and the characterization of slender regular languages proved independently by Păun and Salomaa and by Shallit.
-
Classes of propositional UMU formulas and their extensions to minimal unsatisfiable formulas Theor. Comput. Sci. (IF 1.1) Pub Date : 2024-03-29 Hans Kleine Büning
The class UMU consists of propositional formulas which are a union of minimal unsatisfiable formulas (MU formulas). The structural complexity of UMU formulas depends essentially on the type and degree of intertwining of the MU subformulas. Starting from class of formulas that consist only of clause (or variable) disjoint minimal unsatisfiable subformulas, we study various UMU subclasses given by weakening
-
Behavioral equivalences for AbU: Verifying security and safety in distributed IoT systems Theor. Comput. Sci. (IF 1.1) Pub Date : 2024-03-28 Michele Pasqua, Marino Miculan
(▪in short) is an interaction mechanism recently introduced for adapting the (ECA) programming paradigm to distributed reactive systems, such as autonomic and smart IoT device ensembles. In this model, an event (e.g., an input from a sensor, or a device state update) can trigger an ECA rule, whose execution can cause the state update of (possibly) many remote devices at once; the latter are selected
-
Factor-balanced S-adic languages Theor. Comput. Sci. (IF 1.1) Pub Date : 2024-03-28 Léo Poirier, Wolfgang Steiner
A set of words, also called a language, is letter-balanced if the number of occurrences of each letter only depends on the length of the word, up to a constant. Similarly, a language is factor-balanced if the difference of the number of occurrences of any given factor in words of the same length is bounded. The most prominent example of a letter-balanced but not factor-balanced language is given by
-
Graph convexity impartial games: Complexity and winning strategies Theor. Comput. Sci. (IF 1.1) Pub Date : 2024-03-27 Samuel N. Araújo, João Marcos Brito, Raquel Folz, Rosiane de Freitas, Rudini M. Sampaio
Accordingly to Duchet (1987), the first paper of convexity on general graphs, in english, is the 1981 paper “Convexity in graphs”. One of its authors, Frank Harary, introduced in 1984 the first graph convexity games, focused on the geodesic convexity, which were investigated in a sequence of five papers that ended in 2003. In this paper, we continue this research line, extend these games to other graph
-
A logarithmic-sized accountable ring signature scheme in the standard model Theor. Comput. Sci. (IF 1.1) Pub Date : 2024-03-25 Keisuke Hara
Ring signature and group signature are two major cryptographic primitives providing users anonymity and authentication simultaneously. While both primitives enable any user to sign messages as a member of a set of users, the feature of ring signature is that a signer can choose a group in an ad-hoc manner, which is called a ring, by itself. Conversely, in group signature, a group membership is managed
-
New algorithms for fair k-center problem with outliers and capacity constraints Theor. Comput. Sci. (IF 1.1) Pub Date : 2024-03-25 Xiaoliang Wu, Qilong Feng, Jinhui Xu, Jianxin Wang
The fair -center problem has been paid lots of attention recently. In the fair -center problem, we are given a set of points in a metric space and a parameter , where the points in are divided into several groups, and each point is assigned a color to denote which group it is in. The goal is to partition into clusters such that the number of cluster centers with each color is equal to a given value
-
On the complexity of nucleolus computation for bipartite b-matching games Theor. Comput. Sci. (IF 1.1) Pub Date : 2024-03-24 Jochen Könemann, Justin Toth, Felix Zhou
We explore the complexity of nucleolus computation in -matching games on bipartite graphs. We show that computing the nucleolus of a simple -matching game is -hard when even on bipartite graphs of maximum degree 7. We complement this with partial positive results in the special case where values are bounded by 2. In particular, we describe an efficient algorithm when a constant number of vertices satisfy
-
Computational complexity of normalizing constants for the product of determinantal point processes Theor. Comput. Sci. (IF 1.1) Pub Date : 2024-03-24 Tatsuya Matsuoka, Naoto Ohsaka
We consider the (DPPs), a point process whose probability mass is proportional to the product of principal minors of matrices, as a natural, promising generalization of DPPs. We study the computational complexity of computing its , which is among the most essential probabilistic inference tasks. Our complexity-theoretic results (almost) rule out the existence of efficient algorithms for this task unless
-
Intrinsic universality in automata networks I: Families and simulations Theor. Comput. Sci. (IF 1.1) Pub Date : 2024-03-21 Martín Ríos-Wilson, Guillaume Theyssier
An automata network (AN) is a finite graph where each node holds a state from a finite alphabet and is equipped with a local map defining the evolution of the state of the node depending on its neighbors. They are studied both from the dynamical and the computational complexity point of view. Inspired from well-established notions in the context of cellular automata, we develop a theory of intrinsic
-
Factorisation in the semiring of finite dynamical systems Theor. Comput. Sci. (IF 1.1) Pub Date : 2024-03-21 Émile Naquin, Maximilien Gadouleau
Finite dynamical systems (FDSs) are commonly used to model systems with a finite number of states that evolve deterministically and at discrete time steps. Considered up to isomorphism, those correspond to functional graphs. As such, FDSs have a sum and product operation, which correspond to the direct sum and direct product of their respective graphs; the collection of FDSs endowed with these operations
-
Tipsy cop and tipsy robber: Collisions of biased random walks on graphs Theor. Comput. Sci. (IF 1.1) Pub Date : 2024-03-21 Pamela E. Harris, Erik Insko, Florian Lehner
Introduced by Harris, Insko, Prieto Langarica, Stoisavljevic, and Sullivan, the is a variant of the cop and robber game on graphs in which the robber simply moves randomly along the graph, while the cop moves directed towards the robber some fixed proportion of the time and randomly the remainder. In this article, we adopt a slightly different interpretation of tipsiness of the cop and robber where
-
Molecular pattern formation on grids in the Moblot model Theor. Comput. Sci. (IF 1.1) Pub Date : 2024-03-20 Serafino Cicerone, Alessia Di Fonso, Gabriele Di Stefano, Alfredo Navarra
In the theoretical studies on distributed algorithms for swarm robotics, the complexity and capabilities of the robots are usually reduced to their minimum. Recently, the model has been introduced in order to deal with robots considered silent, anonymous, and oblivious but capable to aggregate into more complex structures, called . We study the case where robots move along a graph based on a square
-
Constrained Kripke structure for identifying parameters of biological models Theor. Comput. Sci. (IF 1.1) Pub Date : 2024-03-19 Jean-Paul Comet, Hélène Collavizza, Laetitia Gibart
When modelling a complex biological system, the bottleneck of the process is the determination of parameter values that lead to model dynamics that are compatible with observations. Even for discrete modelling frameworks, this step can be limiting. Here we introduce a representation of the whole family of discrete models that can be associated to a biological system, where states are shared by all
-
Grouped domination parameterized by vertex cover, twin cover, and beyond Theor. Comput. Sci. (IF 1.1) Pub Date : 2024-03-19 Tesshu Hanaka, Hirotaka Ono, Yota Otachi, Saeki Uda
A dominating set of graph is called an if can be partitioned into such that the size of each unit is and the subgraph of induced by is connected. The concept of -grouped dominating sets generalizes several well-studied variants of dominating sets with requirements for connected component sizes, such as the ordinary dominating sets (), paired dominating sets (), and connected dominating sets ( is arbitrary
-
Parameterized complexity of broadcasting in graphs Theor. Comput. Sci. (IF 1.1) Pub Date : 2024-03-18 Fedor V. Fomin, Pierre Fraigniaud, Petr A. Golovach
The task of the broadcast problem is, given a graph and a source vertex , to compute the minimum number of rounds required to disseminate a piece of information from to all vertices in the graph. It is assumed that, at each round, an informed vertex can transmit the information to at most one of its neighbors. The broadcast problem is known to NP-hard. We show that the problem is FPT when parametrized
-
On the power of threshold-based algorithms for detecting cycles in the CONGEST model Theor. Comput. Sci. (IF 1.1) Pub Date : 2024-03-16 Pierre Fraigniaud, Maël Luce, Ioan Todinca
It is known that, for every , -freeness can be decided by a generic Monte-Carlo algorithm running in rounds in the model. For , faster Monte-Carlo algorithms do exist, running in rounds, based on upper bounding the number of messages to be forwarded, and aborting search sub-routines for which this number exceeds certain thresholds. We investigate the possible extension of these algorithms, for the
-
Reinforcing privacy in cloud computing via adaptively secure non-zero inner product encryption and anonymous identity-based revocation in unbounded setting Theor. Comput. Sci. (IF 1.1) Pub Date : 2024-03-16 Subhranil Dutta, Tapas Pal, Ratna Dutta
Cloud computing serves as an advanced computing technology to support Internet services and has numerous applications, including medical fields, online data storage, social network, big data analysis, and e-learning platforms. () is a promising cryptographic primitive that facilitates access control over outsourced encrypted data by restricting decryption capability via an inner product relation. Most
-
Converting finite width AFAs to nondeterministic and universal finite automata Theor. Comput. Sci. (IF 1.1) Pub Date : 2024-03-15 Mohammad Zakzok, Kai Salomaa
The maximal existential (respectively, universal) width of an alternating finite automaton (AFA) on a string is the maximal number of existential choices encountered in one branch (respectively, the maximal number of universal parallel branches) of a computation of on . We give upper bounds for the size of a nondeterministic finite automaton simulating an AFA of finite maximal universal width and for
-
Complexity of a Root Clustering Algorithm for Holomorphic Functions Theor. Comput. Sci. (IF 1.1) Pub Date : 2024-03-15 Prashant Batra, Vikram Sharma
Approximating the roots of a holomorphic function in an input box is a fundamental problem in many domains. Most algorithms in the literature for solving this problem are conditional, i.e., they make some simplifying assumptions, such as, all the roots are simple or there are no roots on the boundary of the input box, or the underlying machine model is Real RAM. Root clustering is a generalization
-
On the power of pushing or stationary moves for input-driven pushdown automata Theor. Comput. Sci. (IF 1.1) Pub Date : 2024-03-15 Martin Kutrib, Andreas Malcher, Matthias Wendlandt
Input-driven pushdown automata (IDPDAs) are pushdown automata where the next action on the pushdown store (push, pop, nothing) is solely governed by the input symbol. Nowadays such devices are usually defined such that every push operation pushes exactly one additional symbol on the pushdown store and, in addition, stationary moves are not allowed so that the devices work in real time. Here, we relax
-
Computing the hull and interval numbers in the weakly toll convexity Theor. Comput. Sci. (IF 1.1) Pub Date : 2024-03-13 Mitre C. Dourado, Marisa Gutierrez, Fábio Protti, Silvia Tondato
A walk of a graph is a if , implies , and implies . The of a set , denoted by , is formed by and the vertices belonging to some weakly toll walk between two vertices of . Set is if . The of , denote by , is the minimum weakly toll convex set containing . The of is the minimum cardinality of a set such that ; and the of is the minimum cardinality of a set such that . In this work, we show how to compute
-
Networks of Watson-Crick D0L systems with communication by substrings Theor. Comput. Sci. (IF 1.1) Pub Date : 2024-03-12 Erzsébet Csuhaj-Varjú, György Vaszil
Watson-Crick D0L systems (WD0L systems) are augmented variants of D0L systems defined over a DNA-like alphabet, where each letter has a complementary letter and this relation is symmetric. WD0L systems operate under a control that is inspired by the well-known phenomenon of Watson-Crick complementarity of the double helix of DNA. Depending on a trigger, the standard D0L rewriting step is applied either
-
Almost-surely terminating asynchronous Byzantine agreement against general adversaries with optimal resilience Theor. Comput. Sci. (IF 1.1) Pub Date : 2024-03-07 Ashish Choudhury
In this work, we study almost-surely terminating (ABA) for parties tolerating a adversary. While the existing works in this domain have primarily considered a adversarial model where the adversary can corrupt any subset of up to parties, attention has been paid to the adversarial model. In the latter model, the corruption capacity of the adversary is characterized by an adversary structure , which
-
Beyond windability: Approximability of the four-vertex model Theor. Comput. Sci. (IF 1.1) Pub Date : 2024-03-06 Tianyu Liu, Xiongxin Yang
We study the approximability of the four-vertex model, a special case of the six-vertex model. We prove that, despite being NP-hard to approximate in the worst case, the four-vertex model admits a fully polynomial randomized approximation scheme (FPRAS) when the input satisfies certain linear equation system over . The FPRAS is given by a Markov chain known as the , whose state space and rapid mixing
-
GF(2)-operations on basic families of formal languages Theor. Comput. Sci. (IF 1.1) Pub Date : 2024-03-06 Alexander Okhotin, Maria Radionova, Elizaveta Sazhneva
GF(2)-operations on formal languages (Bakinova et al., “Formal languages over GF(2)”, Inf. Comput., 2022) are variants of the classical concatenation and Kleene star obtained by replacing Boolean logic in their definitions with the GF(2) field. This paper investigates closure and non-closure of basic families of languages under these operations. First, it is proved that the group languages (those defined
-
Recognizing geometric intersection graphs stabbed by a line Theor. Comput. Sci. (IF 1.1) Pub Date : 2024-03-06 Dibyayan Chakraborty, Kshitij Gajjar, Irena Rusu
In this paper, we determine the computational complexity of recognizing two graph classes, -graphs and graphs. An -shape is made by joining the bottom end-point of a vertical (|) segment to the left end-point of a horizontal (−) segment. The top end-point of the vertical segment is known as the of the -shape. Grounded -graphs are the intersection graphs of -shapes such that all the -shapes' anchors
-
An upper bound on asymptotic repetition threshold of balanced sequences via colouring of the Fibonacci sequence Theor. Comput. Sci. (IF 1.1) Pub Date : 2024-03-06 L'ubomíra Dvořáková, Edita Pelantová
We colour the Fibonacci sequence by suitable constant gap sequences to provide an upper bound on the asymptotic repetition threshold of -ary balanced sequences. The bound is attained for and 8 and we conjecture that it happens for infinitely many even 's.
-
The synchronized ambient calculus Theor. Comput. Sci. (IF 1.1) Pub Date : 2024-03-01 Toru Kato, Yoichi Hirashima
We propose a process algebra called “the synchronized ambient calculus (SAC)”, which is an extension of the ambient calculus (AC). The processes of AC have a layered structure of ambients that enable us to describe not only mobile processes but also real entities such as networks, factories and freight systems in which synchronization between objects is crucial. For example, a container must be brought
-
Hardness of (M)LWE with semi-uniform seeds Theor. Comput. Sci. (IF 1.1) Pub Date : 2024-02-29 Wenjuan Jia, Jiang Zhang, Binwu Xiang, Baocang Wang
Let be the LWE problem in matrix form , where are randomly chosen respectively from the seed distribution over , secret distribution over and noise distribution over (or ), i.e., . For various secret-noise distributions , the problem is shown to be as hard as some standard worst-case lattice problems, but most of the known results require to be the uniform distribution over . In this paper, we show
-
Puzzle and Dragons is hard Theor. Comput. Sci. (IF 1.1) Pub Date : 2024-02-29 JunYi Guo, Po-Chun Yu
Candy Crush Saga (CCS) is a mobile game released in 2012. Based on a specific game-play, it was proven to be NP-complete in 2014. The 15-slide puzzle is also a classic game that has been proven to be NP-complete. In 2012, a brand new ball-spinning game called Puzzle and Dragons emerged. Puzzle and Dragons (PAD) combines the three-elimination game-play of Candy Crush Saga and the 15-puzzle. This study
-
A new McEliece-type cryptosystem using Gabidulin-Kronecker product codes Theor. Comput. Sci. (IF 1.1) Pub Date : 2024-02-29 Zhe Sun, Jincheng Zhuang, Zimeng Zhou, Fang-Wei Fu
This paper presents a new McEliece-type cryptosystem using Gabidulin-Kronecker product codes in the rank metric. The contributions of this paper are as follows. Firstly, we propose a new Gabidulin-Kronecker product code which is a kind of block circulant code, and give an efficient decoding algorithm. Secondly, we design a one-way secure public key encryption scheme based on the Gabidulin-Kronecker
-
Space limited linear-time graph algorithms on big data Theor. Comput. Sci. (IF 1.1) Pub Date : 2024-02-28 Jianer Chen, Zirui Chu, Ying Guo, Wei Yang
We study algorithms for graph problems in which the graphs are of extremely large size so that super-linear time or linear space would become impractical. We use a parameter to characterize the computational power of a normal computer that can provide additional time and space bounded by polynomials of in dealing with the large graphs. In particular, we are interested in strict linear-time algorithms
-
Simon's congruence pattern matching Theor. Comput. Sci. (IF 1.1) Pub Date : 2024-02-28 Sungmin Kim, Sang-Ki Ko, Yo-Sub Han
The Simon's congruence problem is to determine whether or not two strings have the same set of subsequences of length no greater than a given integer, and the problem can be answered in linear time. We consider the Simon's congruence pattern matching problem that looks for all substrings of a text that are congruent to a pattern under the Simon's congruence. We propose a linear time algorithm by reusing
-
Two-stage BP maximization under p-matroid constraint Theor. Comput. Sci. (IF 1.1) Pub Date : 2024-02-28 Hong Chang, Jing Jin, Zhicheng Liu, Donglei Du, Xiaoyan Zhang
The BP problem maximizes the sum of a suBmodular function and a suPermodular function(BP) subject to some constraints, where both functions are nonnegative and monotonic. This problem has been widely studied under the single-stage setting. In this paper, we consider a variant of the BP maximization problem. The problem is a two-stage BP maximization problem subject to a -matroid constraint, for which
-
The impact of core constraints on truthful bidding in combinatorial auctions Theor. Comput. Sci. (IF 1.1) Pub Date : 2024-02-28 Robin Fritsch, Younjoo Lee, Adrian Meier, Kanye Ye Wang, Roger Wattenhofer
Combinatorial auctions (CAs) offer the flexibility for bidders to articulate complex preferences when competing for multiple assets. However, the behavior of bidders under different payment rules is often unclear. Our research explores the relationship between core constraints and several core-selecting payment rules. Specifically, we examine the natural and desirable property of payment rules of being
-
Recognizing when a preference system is close to admitting a master list Theor. Comput. Sci. (IF 1.1) Pub Date : 2024-02-27 Ildikó Schlotter
A preference system is an undirected graph where vertices have preferences over their neighbors, and admits a master list if all preferences can be derived from a single ordering over all vertices. We study the problem of deciding whether a given preference system is admitting a master list based on three different distance measures. We determine the computational complexity of the following questions:
-
Distributed Grover's algorithm Theor. Comput. Sci. (IF 1.1) Pub Date : 2024-02-23 Daowen Qiu, Le Luo, Ligang Xiao
In this paper, we propose a distributed Grover's algorithm, and it requires fewer qubits and has a linear advantage in time complexity compared to the original Grover's algorithm. More exactly, to search for a target in an unstructured database with elements, Grover's algorithm can get the target with query complexity , but our distributed Grover's algorithm with computing nodes can get the target
-
Computational task offloading algorithm based on deep reinforcement learning and multi-task dependency Theor. Comput. Sci. (IF 1.1) Pub Date : 2024-02-23 Xiaoqi Zhang, Tengxiang Lin, Cheng-Kuan Lin, Zhen Chen, Hongju Cheng
Edge computing is an emerging promising computing paradigm, which can significantly reduce the service latency by moving computing and storage demands to the edge of the network. Resource-constrained edge servers may fail to process multiple tasks simultaneously when several time-delay-sensitive and computationally demanding tasks are offloaded to only one edge server, and results in some issues such
-
Ordered scheduling in control-flow distributed transactional memory Theor. Comput. Sci. (IF 1.1) Pub Date : 2024-02-23 Pavan Poudel, Shishir Rai, Swapnil Guragain
Consider the model of transaction execution in a distributed system modeled as a communication graph where shared objects positioned at nodes of the graph are immobile but the transactions accessing the objects send requests to the nodes where objects are located to read/write those objects. The control-flow model offers benefits to applications in which the movement of shared objects is costly due
-
Near optimal colourability on hereditary graph families Theor. Comput. Sci. (IF 1.1) Pub Date : 2024-02-22 Yiao Ju, Shenwei Huang
In this paper, we initiate a systematic study on a new notion called near optimal colourability which is closely related to perfect graphs and the Lovász theta function. A graph family is if there is a constant number such that every graph satisfies , where and are the chromatic number and clique number of , respectively. The near optimal colourable graph families together with the Lovász theta function
-
Fully anonymous identity-based broadcast signcryption with public verification Theor. Comput. Sci. (IF 1.1) Pub Date : 2024-02-22 Zhaoman Liu, Yanbo Chen, Jianting Ning, Yunlei Zhao
In the multicast communication scenario, compared with broadcast encryption, broadcast signcryption or multi-receiver signcryption has additional ability to authenticate the source of the message. With the enhanced awareness of privacy preservation, ordinary users pay more attention to the identity leakage in the communication process. The primitive of anonymous broadcast signcryption has been proposed
-
Quantum clustering with k-Means: A hybrid approach Theor. Comput. Sci. (IF 1.1) Pub Date : 2024-02-21 Alessandro Poggiali, Alessandro Berti, Anna Bernasconi, Gianna M. Del Corso, Riccardo Guidotti
Quantum computing, based on quantum theory, holds great promise as an advanced computational paradigm for achieving fast computations. Quantum algorithms are expected to surpass their classical counterparts in terms of computational complexity for certain tasks, including machine learning. In this paper, we design, implement, and evaluate three hybrid quantum -Means algorithms, exploiting different
-
First-order logic axiomatization of metric graph theory Theor. Comput. Sci. (IF 1.1) Pub Date : 2024-02-21 Jérémie Chalopin, Manoj Changat, Victor Chepoi, Jeny Jacob
The main goal of this note is to provide a axiomatization of the main classes of graphs occurring in Metric Graph Theory, in analogy to Tarski's axiomatization of Euclidean geometry. We provide such an axiomatization for weakly modular graphs and their principal subclasses (median and modular graphs, bridged graphs, Helly graphs, dual polar graphs, etc), basis graphs of matroids and even Δ-matroids
-
Integer k-matching preclusion of some interconnection networks Theor. Comput. Sci. (IF 1.1) Pub Date : 2024-02-19 Hailun Wu, Lina Ba, Heping Zhang
For a positive integer , a -matching of a graph is a function : such that for every vertex of , where represents the set of all edges incident to . The (strong) -matching preclusion number of , denoted by , is the minimum size of (edges and vertices) edges whose deletion leaves the remaining subgraph that has neither perfect -matchings nor almost perfect -matchings. This is a generalization of the
-
-
Online hitting of unit balls and hypercubes in [formula omitted] using points from [formula omitted] Theor. Comput. Sci. (IF 1.1) Pub Date : 2024-02-15 Minati De, Satyam Singh
We consider the online hitting set problem for the range space , where the point set is known beforehand, but the set of geometric objects is not known in advance. Here, objects from arrive one by one. The objective of the problem is to maintain a hitting set of the minimum cardinality by taking irrevocable decisions. In this paper, we consider the problem when objects are unit balls or unit hypercubes
-
A tree structure for local diagnosis in multiprocessor systems under the comparison model Theor. Comput. Sci. (IF 1.1) Pub Date : 2024-02-13 Meirun Chen, Cheng-Kuan Lin, Kung-Jui Pai
Diagnosability is an important indicator to measure the reliability of multiprocessor systems. If we focus on the status of a particular node, instead of doing global diagnosis, Hsu and Tan introduced the concept of local diagnosis and proposed an extended star structure to diagnose a node under the comparison model. Usually, there is a gap between the local diagnosability and the lower bound guaranteed
-
Some new algorithmic results on co-secure domination in graphs Theor. Comput. Sci. (IF 1.1) Pub Date : 2024-02-13 Kusum, Arti Pandey
For a simple graph without any isolated vertex, a of satisfies two properties, (i) is a dominating set of , (ii) for every vertex , there exists a vertex such that and is a dominating set of . The minimum cardinality of a co-secure dominating set of is called the of and is denoted by . The problem is to find a co-secure dominating set of a graph of cardinality . The decision version of the problem
-
Jump complexity of finite automata with translucent letters Theor. Comput. Sci. (IF 1.1) Pub Date : 2024-02-12 Victor Mitrana, Andrei Păun, Mihaela Păun, José Ramón Sánchez Couso
We define the jump complexity of a finite automaton with translucent letters as a function that computes the smallest upper bound on the number of jumps needed by the automaton in order to accept each word of length , for any positive integer . We prove that a sufficient condition for a finite automaton with translucent letters to accept a regular language is to have a jump complexity bounded by a
-
Approximation algorithms for drone delivery scheduling with a fixed number of drones Theor. Comput. Sci. (IF 1.1) Pub Date : 2024-02-09 Saswata Jana, Partha Sarathi Mandal
The coordination among drones and ground vehicles for last-mile delivery has gained significant interest in recent years. In this paper, we study (MDSP) for last-mile delivery, where we have a set of drones with an identical battery budget and a set of delivery locations; along with profit for delivery, cost, and delivery time intervals. The objective of the MDSP is to find conflict-free schedules
-
Practical and malicious private set intersection with improved efficiency Theor. Comput. Sci. (IF 1.1) Pub Date : 2024-02-09 Yizhao Zhu, Lanxiang Chen, Yi Mu
We propose a novel two-party private set intersection (PSI) protocol, which achieves ideal and constant receiver-to-sender and linear sender-to-receiver communication overhead, linear computational complexity, along with receiver size-hiding and lightweight computation cost. In comparison with other PSI protocols, the proposed protocol is more practical as it does not require any fully homomorphic
-
Fair division with minimal withheld information in social networks Theor. Comput. Sci. (IF 1.1) Pub Date : 2024-02-08 Ivan Bliznets, Anton Bukov, Danil Sagunov
We present a study of a few graph-based problems motivated by fair allocation of resources in a social network. The central role in the paper is played by the following problem: What is the largest number of items we can allocate to the agents in the given social network so that each agent hides at most one item and overall at most items are hidden, and no one envies its neighbors? We show that the
-