Showing papers in "Information Processing Letters in 2021"

TL;DR: This work presents the first $\mathrm{o}(n)$-space polynomial-time algorithm for computing the length of a longest common subsequence given two strings of length $n'.

TL;DR: In this paper, it was shown that b i n d (G ) > 5 3 is the tight bound for 2-edge-connected graphs that are not P ≥ 3 -factor uniform.

TL;DR: Two representation theorems for stably continuous semi-lattices are obtained and the equivalence of the categories corresponding to these three structures is shown.

TL;DR: In this article, the authors considered the single source Pareto problem in weighted point-availability time-dependent networks, which consists of computing, for any destination d, all pareto optimal pairs ( t, c ), where t and c are the arrival time and the cost, respectively, of a path from the source to d.

TL;DR: This paper addresses the problem of characterizing query instability behavior over centered Gaussian data generation distributions and Euclidean distance by establishing sufficient conditions on the covariance matrices and dataset size function under which the probability of query instability approaches one.

TL;DR: In this paper, it was shown that for planar bipartite subcubic graphs with girth at most 16, the problem of determining whether a k-edge-coloring exists is NP-complete.

TL;DR: This work improves the lower complexity bound to PSpace, even in the acyclic case, and investigates the coverability problem for a one-dimensional restriction of pushdown vector addition systems with states with states.

TL;DR: This study demonstrates that a slight modification of the encoding scheme, by using ∞ instead of 0 to denote the first occurrences of each parameterized symbol, enables us to develop a much simpler FM-index for this problem, which only comprises two wavelet trees and one range maximum query index.

TL;DR: A new computational problem called the Gap Closest Vector Problem with Bounded Minima is introduced, which implies that, under Gap-ETH, there is no randomised 2 o ( n ) -time algorithm for approximating SIVP p up to some constant factor γ ≥ 1 for any 1 ≤ p ≤ ∞ .

TL;DR: An explicit combinatorial characterization of all its $4$- and $6$-cycles is given and a new approach to construct a Hamiltonian cycle based on these generalized prisms is presented.

TL;DR: The computational study shows that on various artificial and real benchmark sets this algorithm scales better with growing instance size and requires significantly less computation time to prove optimality than earlier state-of-the-art approaches from the literature.

TL;DR: In this article, the authors study the two-opposite-facility location game on a line segment, where a mechanism determines the locations of a popular facility and an obnoxious facility for finitely many agents.

TL;DR: It is proved that the Nearest Neighbor algorithm's competitive ratio on trees with $n$ vertices is $\Theta(\log n)$, i.e. no better than on general graphs.

TL;DR: A distributed algorithm for solving Laplacian systems on strongly connected directed graphs, the first that can be analyzed in terms of the underlying graph's parameters, is presented.

TL;DR: This note elaborate on previous research to refine and characterize the concepts of a detector and a differentiator, used in mutation testing, where it is important to highlight semantic differences between non-equivalent mutants.

TL;DR: In this paper, it was shown that the reachability problem can be solved in O(n ω ⋅ log 2 ⁡ n ) time for OCSs and O( n 2 ) time on sparse PDSs when restricted to witness executions of stack height bounded by log n.

TL;DR: This paper shows how to obtain the Robbins-Ardila result from Berstel's with almost no work at all, using purely computational techniques that can be performed by existing software.

TL;DR: In this article, a de Bruijn sequence of order n over a k-symbol alphabet is extended by adding a new symbol to the alphabet to ensure that there are no long runs without the new symbol.

TL;DR: It is proved that, among all distributions that act on the class of all subsets of size s of the coupons, the uniform distribution minimizes the expectation of W n , s if s = n − 1 .

TL;DR: It is shown that there is no subexponential time algorithm for computing the exact solution of the maximum independent set problem in d-regular graphs, unless ETH fails, and the construction is utilized to show the NP-hardness of MIS on 5-regular planar graphs, closing the exact complexity status of the problem on regular planar graph.

TL;DR: It is shown that the x-type of P can already be reconstructed from the compatible exchange graph G 1 ( P) , which is a subgraph of G 0 ( P ) .

TL;DR: This paper presents a correction of the two main theorems claimed by Ma and Yao concerning the number and the entropy of spanning trees of a class of self-similar fractal models with proofs of the new results.

TL;DR: The chromatic number $\chi_s(G)$ of a signed graph $G$ is the order of a smallest signed graph H such that there is a homomorphism from G to H and it is shown that the Chromatic number of signed triangular grids is at most 10 and the chromaticNumber of signed hexagonal grids isAt most 4.

TL;DR: This paper gives a kernel to the K_t-free edge deletion problem with O(k^{t-1}) vertices and edges by deciding whether there is a set of at most at most k edges of G whose removal results in a graph with no clique of size t.

TL;DR: An algorithm for Bicluster Editing whose running time is O^*(3.116^k) is given.

TL;DR: It is shown that weighted automata over the field of two elements can be exponentially more compact than non-deterministic finite state automata, and are also efficiently learnable in Angluin's minimal adequate teacher model.

TL;DR: This study demonstrates that the split-star network S n 2, n ≥ 4, is super spanning connected based on a recent result on the alternating group graph A G n.

TL;DR: In this article, the first stack avoids a pair of patterns of length 3 and investigate those pairs for which sortable permutations are counted by the (binomial transform of the) Catalan numbers and the Schroder numbers.

TL;DR: An elementary argument building on group actions is used to prove that the selection-free steady state genetic algorithm analyzed by Sutton and Witt (GECCO 2019) takes an expected number of $\Omega(2^n / \sqrt n)$ iterations to find any particular target search point, regardless of the population size $\mu$.

TL;DR: For all k ≥ 1, it is known that deciding whether a graph is k-planar is NP-complete as discussed by the authors, extending the well-known fact that deciding 1-planarity is NPcomplete.