-
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 A, s, h, i, s, h, , C, h, o, u, d, h, u, r, y
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
-
-
Simple, strict, proper, happy: A study of reachability in temporal graphs Theor. Comput. Sci. (IF 1.1) Pub Date : 2024-02-06 Arnaud Casteigts, Timothée Corsini, Writika Sarkar
Dynamic networks are a complex subject. Not only do they inherit the complexity of static networks (as a particular case); they are also sensitive to definitional subtleties that are a frequent source of confusion and incomparability of results in the literature.
-
On a model of online analog computation in the cell with absolute functional robustness: Algebraic characterization, function compiler and error control Theor. Comput. Sci. (IF 1.1) Pub Date : 2024-02-05 Mathieu Hemery, François Fages
The Turing completeness of continuous Chemical Reaction Networks (CRNs) states that any computable real function can be computed by a continuous CRN on a finite set of molecular species, possibly restricted to elementary reactions, i.e. with at most two reactants and mass action law kinetics. In this paper, we introduce a more stringent notion of robust online analog computation, called Absolute Functional
-
Approximate core allocations for edge cover games Theor. Comput. Sci. (IF 1.1) Pub Date : 2024-02-05 Tianhang Lu, Han Xiao, Qizhi Fang
Edge cover games are cooperative cost games arising from edge cover problems. In an edge cover game, each player controls a vertex and the cost of a coalition is the minimum weight of edge covers in the subgraph induced by the coalition. The approximate core is a relaxation of the core which is one of the most important concepts in cooperative game theory. A vector belongs to the -core () if it recovers
-
Query complexity of tournament solutions Theor. Comput. Sci. (IF 1.1) Pub Date : 2024-01-30 Arnab Maiti, Palash Dey
A directed graph where there is exactly one edge between every pair of vertices is called a tournament. Finding the “best” set of vertices of a tournament is a well-studied problem in social choice theory. A tournament solution takes a tournament as input and outputs a subset of vertices of the input tournament. However, in many applications, for example, choosing the best set of drugs from a given
-
Efficient code-based fully dynamic group signature scheme Theor. Comput. Sci. (IF 1.1) Pub Date : 2024-01-29 Luping Wang, Jie Chen, Huan Dai, Chongben Tao
Code-based group signature is an important research topic in recent years. Since the pioneering work by Alamélou et al.(WCC 2015), several other schemes have been proposed to provide improvements in security, efficiency and functionality. However, most existing constructions work only in the static setting where the group population is fixed at the setup phase. Only a few schemes address partially
-
Constructions of 2-resilient rotation symmetric Boolean functions with odd number of variables Theor. Comput. Sci. (IF 1.1) Pub Date : 2024-02-02 Jiao Du, Lin Li, Shaojing Fu, Longjiang Qu, Chao Li
In this paper, a new method for constructing 2-resilient rotation symmetric Boolean functions with odd number of variables is presented. Based on an equivalent characterization of this class of functions and the relation between the orbit matrices and their complements, a system of equations about 2-tuples distribution matrix is established. Then the constructions of some 2-resilient rotation symmetric
-
The compatibility of the minimalist foundation with homotopy type theory Theor. Comput. Sci. (IF 1.1) Pub Date : 2024-02-02 Michele Contente, Maria Emilia Maietti
The Minimalist Foundation, MF for short, is a two-level foundation for constructive mathematics ideated by Maietti and Sambin in 2005 and then fully formalized by Maietti in 2009. MF serves as a common core among the most relevant foundations for mathematics in the literature by choosing for each of them the appropriate level of MF to be translated in a compatible way, namely by preserving the meaning
-
-
Edge searching and fast searching with constraints Theor. Comput. Sci. (IF 1.1) Pub Date : 2024-01-26 Lusheng Wang, Boting Yang
In this paper, we consider the edge searching problem and the fast searching problem with constraints on some vertices. The edge searching problem was introduced by Megiddo et al. (1988), in which a group of searchers want to capture an invisible robber. The fast searching problem was introduced by Dyer et al. (2008). One constraint we consider for these two searching models is that a subset of vertices
-
An FPT algorithm for node-disjoint subtrees problems parameterized by treewidth Theor. Comput. Sci. (IF 1.1) Pub Date : 2024-01-24 Julien Baste, Dimitri Watel
In this paper, we introduce a problem called Minimum subTree problem with Degree Weights, or MTDW. This problem generalized covering tree problems like Spanning Tree, Steiner Tree, Minimum Branch Vertices, Minimum Leaf Spanning Tree, or Prize Collecting Steiner Tree. It consists, given an undirected graph G=(V,E), a set of m+1 mappings C1,C2,…,Cm,D:V×N→Z, a set of m integers K1,K2,…,Km∈Z and a positive
-
Smash and grab: The 0 ⋅ 6 scoring game on graphs Theor. Comput. Sci. (IF 1.1) Pub Date : 2024-01-26 Éric Duchêne, Valentin Gledel, Sylvain Gravier, Fionn Mc Inerney, Mehdi Mhalla, Aline Parreau
In this paper, we introduce and study a new scoring game on graphs called smash and grab. In this game, two players, called Left and Right, take turns removing a vertex of the graph as well as all of its neighbours that become isolated by this removal. For each player and each of their turns, they score the number of vertices that were removed on their turn. The game ends when there are no more vertices
-
Approximation algorithm of maximizing non-monotone non-submodular functions under knapsack constraint Theor. Comput. Sci. (IF 1.1) Pub Date : 2024-01-24 Yishuo Shi, Xiaoyan Lai
The maximization of non-negative monotone submodular functions under a certain constraint is intensively studied. However, there are few works considering the maximization of non-monotone non-submodular functions, which even might be negative. These functions also have many applications, such as optimal marketing for revenue maximization over social networks, budget allocation problems, and Epidemic
-
How fast can we play Tetris greedily with rectangular pieces? Theor. Comput. Sci. (IF 1.1) Pub Date : 2024-01-24 Justin Dallant, John Iacono
Consider a variant of Tetris played on a board of width and infinite height, where the pieces are axis-aligned rectangles of arbitrary integer dimensions, the pieces can only be moved before letting them drop, and a row does not disappear once it is full. Suppose we want to follow a greedy strategy: let each rectangle fall where it will end up the lowest given the current state of the board. To do
-
Two homogeneous facility location games with a minimum distance requirement on a circle Theor. Comput. Sci. (IF 1.1) Pub Date : 2024-01-22 Xiaoyu Wu, Lili Mei, Guochuan Zhang
In this paper, we mainly study a game of locating two homogeneous facilities on a circle to serve a set of strategic agents, where two facilities have a minimum distance requirement. The goal of each agent is to maximize or minimize the total distance to the facilities with respect to the facility type. If the facilities are obnoxious, then each agent aims at maximizing the total distance, which is
-
Constrained hitting set problem with intervals: Hardness, FPT and approximation algorithms Theor. Comput. Sci. (IF 1.1) Pub Date : 2024-01-22 Ankush Acharyya, Vahideh Keikha, Diptapriyo Majumdar, Supantha Pandit
We study a constrained version of the Geometric Hitting Set problem where we are given a set of points, partitioned into pairwise disjoint subsets, and a set of intervals. The objective is to hit all the intervals with a minimum number of points such that if we select a point from a subset, we must select all the points from that subset. We consider two special cases of the problem where each subset
-
New support 5-designs from lifted linear codes Theor. Comput. Sci. (IF 1.1) Pub Date : 2024-01-17 Cunsheng Ding
There are many infinite families of 2-designs and 3-designs supported by linear codes in the literature. Recently, several infinite families of 4-designs from linear codes were discovered. But no infinite family of linear codes supporting an infinite family of nontrivial simple 5-designs is reported in the literature. It is not easy to construct 5-designs from sporadic codes. Only a small number of
-
Preface: Special issue on theoretical aspects of computing Theor. Comput. Sci. (IF 1.1) Pub Date : 2024-01-20
Abstract not available
-
Offensive Alliances in Graphs Theor. Comput. Sci. (IF 1.1) Pub Date : 2024-01-17 Ajinkya Gaikwad, Soumen Maity
The Offensive Alliance problem has been studied extensively during the last twenty years. A set S⊆V of vertices is an offensive alliance in an undirected graph G=(V,E) if each v∈N(S) has at least as many neighbours in S as it has neighbours (including itself) not in S. We study the classical and parameterized complexity of the Offensive Alliance problem, where the aim is to find a minimum size offensive
-
Finding dominating induced matchings in P10-free graphs in polynomial time Theor. Comput. Sci. (IF 1.1) Pub Date : 2024-01-19 Andreas Brandstädt, Raffaele Mosca
Let G=(V,E) be a finite undirected graph. An edge set E′⊆E is a dominating induced matching (d.i.m.) in G if every edge in E is intersected by exactly one edge of E′. The Dominating Induced Matching (DIM) problem asks for the existence of a d.i.m. in G; this problem is also known as the Efficient Edge Domination problem; it is the Efficient Domination problem for line graphs. The DIM problem is NP-complete
-
State complexity of binary coded regular languages Theor. Comput. Sci. (IF 1.1) Pub Date : 2024-01-17 Viliam Geffert, Dominika Pališínová, Alexander Szabari
For the given non-unary input alphabet Σ, a maximal prefix code h mapping strings over Σ to binary strings, and an optimal deterministic finite automaton (DFA) A with n states recognizing a language L over Σ, we consider the problem of how many states we need for an automaton A′ that decides membership in h(L), the binary coded version of L. Namely, A′ accepts binary inputs belonging to h(L) and rejects
-
Three remarks on W2 graphs Theor. Comput. Sci. (IF 1.1) Pub Date : 2024-01-17 Carl Feghali, Malory Marin
Let k≥1. A graph G is Wk if for any k pairwise disjoint independent vertex subsets A1,…,Ak in G, there exist k pairwise disjoint maximum independent sets S1,…,Sk in G such that Ai⊆Si for i∈[k]. Recognizing W1 graphs is coNP-hard, as shown by Chvátal and Slater (1993) and, independently, by Sankaranarayana and Stewart (1992). Extending this result and answering a recent question of Levit and Tankus
-
Modular rewritable Petri nets: An efficient model for dynamic distributed systems Theor. Comput. Sci. (IF 1.1) Pub Date : 2024-01-17 Lorenzo Capra, Michael Köhler-Bußmeier
Modern distributed systems are becoming pervasive and increasingly provided with adaptation, (self-)reconfiguration and mobility capability. On one side, to face the challenges of the highly dynamic environments where they are deployed. On the other side, to keep production/maintenance costs down. Therein lies the increasing demand for formal models encompassing all of these aspects (besides concurrency)
-
Refined Computational Complexities of Hospitals/Residents Problem with Regional Caps Theor. Comput. Sci. (IF 1.1) Pub Date : 2024-01-09 Koki Hamada, Shuichi Miyazaki
The Hospitals/Residents problem (HR) is a many-to-one matching problem whose solution concept is stability. It is widely used in assignment systems such as assigning medical students (residents) to hospitals. To resolve imbalance in the number of residents assigned to hospitals, an extension called HR with regional caps (HRRC) was introduced. In this problem, a positive integer (called a regional cap)
-
Generalized sweeping line spanners Theor. Comput. Sci. (IF 1.1) Pub Date : 2024-01-09 Keenan Lee, André van Renssen
We present sweeping line graphs, a generalization of Θ-graphs. We show that these graphs are spanners of the complete graph, as well as of the visibility graph when line segment constraints or polygonal obstacles are considered. Our proofs use general inductive arguments to make the step to the constrained setting. These same arguments could apply to other spanner constructions in the unconstrained