Results 31 to 40 of about 561,904 (322)
Structural Parameterizations of the Biclique-Free Vertex Deletion Problem [PDF]
Discrete Mathematics & Theoretical Computer ScienceIn this work, we study the Biclique-Free Vertex Deletion problem: Given a graph $G$ and integers $k$ and $i \le j$, find a set of at most $k$ vertices that intersects every (not necessarily induced) biclique $K_{i, j}$ in $G$.
Lito Goldmann +2 more
doaj +1 more source
Longest Gapped Repeats and Palindromes [PDF]
Discrete Mathematics & Theoretical Computer Science, 2017 A gapped repeat (respectively, palindrome) occurring in a word $w$ is a factor $uvu$ (respectively, $u^Rvu$) of $w$. In such a repeat (palindrome) $u$ is called the arm of the repeat (respectively, palindrome), while $v$ is called the gap. We show how to
Marius Dumitran +2 more
doaj +1 more source
New Results on Directed Edge Dominating Set [PDF]
Discrete Mathematics & Theoretical Computer Science, 2023 We study a family of generalizations of Edge Dominating Set on directed graphs called Directed $(p,q)$-Edge Dominating Set. In this problem an arc $(u,v)$ is said to dominate itself, as well as all arcs which are at distance at most $q$ from $v$, or at ...
Rémy Belmonte +4 more
doaj +1 more source
New Algorithms for Mixed Dominating Set [PDF]
Discrete Mathematics & Theoretical Computer Science, 2021 A mixed dominating set is a collection of vertices and edges that dominates all vertices and edges of a graph. We study the complexity of exact and parameterized algorithms for \textsc{Mixed Dominating Set}, resolving some open questions.
Louis Dublois +2 more
doaj +1 more source
Lossless fault-tolerant data structures with additive overhead [PDF]
, 2011 12th International Symposium, WADS 2011, New York, NY, USA, August 15-17, 2011. ProceedingsWe develop the first dynamic data structures that tolerate δ memory faults, lose no data, and incur only an O(δ ) additive overhead in overall space and time per ...
Paul Christiano +5 more
core +1 more source
Approximate Distance Sensitivity Oracles in Subquadratic Space [PDF]
TheoretiCSAn $f$-edge fault-tolerant distance sensitive oracle ($f$-DSO) with stretch $\sigma \ge 1$ is a data structure that preprocesses a given undirected, unweighted graph $G$ with $n$ vertices and $m$ edges, and a positive integer $f$.
Davide Bilò +6 more
doaj +1 more source
On the Advice Complexity of Online Matching on the Line [PDF]
Discrete Mathematics & Theoretical Computer ScienceWe consider the matching problem on the line with advice complexity. We give a 1-competitive online algorithm with advice complexity $n-1,$ and show that there is no 1-competitive online algorithm reading less than $n-1$ bits of advice.
Béla Csaba, Judit Nagy-György
doaj +1 more source
An evaluation framework and algorithms for train rescheduling
, 2020 In railway traffic systems, whenever disturbances occur, it is important to effectively reschedule trains while optimizing the goals of various stakeholders.
Josyula, Sai Prashanth, +8 more
core +1 more source
An output-sensitive Algorithm to partition a Sequence of Integers into Subsets with equal Sums [PDF]
Discrete Mathematics & Theoretical Computer Science, 2019 We present a polynomial time algorithm, which solves a nonstandard Variation of the well-known PARTITION-problem: Given positive integers $n, k$ and $t$ such that $t \geq n$ and $k \cdot t = {n+1 \choose 2}$, the algorithm partitions the elements of the ...
Alexander Büchel +2 more
doaj +1 more source
Approximate Counting for Spin Systems in Sub-Quadratic Time [PDF]
TheoretiCSWe present two randomised approximate counting algorithms with $\widetilde{O}(n^{2-c}/\varepsilon^2)$ running time for some constant $c>0$ and accuracy $\varepsilon$: (1) for the hard-core model with fugacity $\lambda$ on graphs with maximum degree $
Konrad Anand +4 more
doaj +1 more source