Results 31 to 40 of about 225,922 (311)
Optimal Space Lower Bound for Deterministic Self-Stabilizing Leader Election Algorithms [PDF]
Discrete Mathematics & Theoretical Computer Science, 2023 Given a boolean predicate $\Pi$ on labeled networks (e.g., proper coloring, leader election, etc.), a self-stabilizing algorithm for $\Pi$ is a distributed algorithm that can start from any initial configuration of the network (i.e., every node has an ...
Lélia Blin +2 more
doaj +1 more source
Composing dynamic programming tree-decomposition-based algorithms [PDF]
Discrete Mathematics & Theoretical Computer ScienceGiven two integers $\ell$ and $p$ as well as $\ell$ graph classes $\mathcal{H}_1,\ldots,\mathcal{H}_\ell$, the problems $\mathsf{GraphPart}(\mathcal{H}_1, \ldots, \mathcal{H}_\ell,p)$, \break $\mathsf{VertPart}(\mathcal{H}_1, \ldots, \mathcal{H}_\ell ...
Julien Baste
doaj +1 more source
Why almost all satisfiable $k$-CNF formulas are easy [PDF]
Discrete Mathematics & Theoretical Computer Science, 2007 Finding a satisfying assignment for a $k$-CNF formula $(k \geq 3)$, assuming such exists, is a notoriously hard problem. In this work we consider the uniform distribution over satisfiable $k$-CNF formulas with a linear number of clauses (clause-variable ...
Amin Coja-Oghlan +2 more
doaj +1 more source
Extension Complexity, MSO Logic, and Treewidth [PDF]
Discrete Mathematics & Theoretical Computer Science, 2020 We consider the convex hull $P_{\varphi}(G)$ of all satisfying assignments of a given MSO formula $\varphi$ on a given graph $G$. We show that there exists an extended formulation of the polytope $P_{\varphi}(G)$ that can be described by $f(|\varphi ...
Petr Kolman +2 more
doaj +1 more source
Verified Approximation Algorithms [PDF]
Logical Methods in Computer Science, 2022 We present the first formal verification of approximation algorithms for NP-complete optimization problems: vertex cover, independent set, set cover, center selection, load balancing, and bin packing.
Robin Eßmann +3 more
doaj +1 more source
Destroying Multicolored Paths and Cycles in Edge-Colored Graphs [PDF]
Discrete Mathematics & Theoretical Computer Science, 2023 We study the computational complexity of $c$-Colored $P_\ell$ Deletion and $c$-Colored $C_\ell$ Deletion. In these problems, one is given a $c$-edge-colored graph and wants to destroy all induced $c$-colored paths or cycles, respectively, on $\ell ...
Nils Jakob Eckstein +3 more
doaj +1 more source
Non-adaptive Group Testing on Graphs [PDF]
Discrete Mathematics & Theoretical Computer Science, 2018 Grebinski and Kucherov (1998) and Alon et al. (2004-2005) study the problem of learning a hidden graph for some especial cases, such as hamiltonian cycle, cliques, stars, and matchings.
Hamid Kameli
doaj +1 more source
Destroying Bicolored $P_3$s by Deleting Few Edges [PDF]
Discrete Mathematics & Theoretical Computer Science, 2021 We introduce and study the Bicolored $P_3$ Deletion problem defined as follows. The input is a graph $G=(V,E)$ where the edge set $E$ is partitioned into a set $E_r$ of red edges and a set $E_b$ of blue edges.
Niels Grüttemeier +3 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
A Linear Kernel for Planar Total Dominating Set [PDF]
Discrete Mathematics & Theoretical Computer Science, 2018 A total dominating set of a graph $G=(V,E)$ is a subset $D \subseteq V$ such that every vertex in $V$ is adjacent to some vertex in $D$. Finding a total dominating set of minimum size is NP-hard on planar graphs and W[2]-complete on general graphs when ...
Valentin Garnero, Ignasi Sau
doaj +1 more source