The complexity of computing optimum labelings for temporal connectivity
A graph is temporally connected if a strict temporal path exists from every vertex u to every other vertex v. This paper studies temporal design problems for undirected temporally connected graphs. Given a connected undirected graph G, the goal ...
Minimum separator reconfiguration
- Guilherme C.M. Gomes,
- Clément Legrand-Duchesne,
- Reem Mahmoud,
- Amer E. Mouawad,
- Yoshio Okamoto,
- Vinicius F. dos Santos,
- Tom C. van der Zanden
We study the problem of reconfiguring s-t-separators on finite simple graphs. We consider several variants of the problem, focusing on the token sliding and jumping models. We begin with a polynomial-time algorithm that computes (if one exists) a ...
Modular SAT-based techniques for reasoning tasks in team semantics
We study the complexity of reasoning tasks for logics in team semantics. Our main focus is on the data complexity of model checking but we also derive new results for logically defined counting and enumeration problems. Our approach is based on ...
Towards declarative comparabilities: Application to functional dependencies
In real life, data are often of poor quality as a result, for instance, of uncertainty, mismeasurements, missing values or bad inputs. This issue hampers an implicit yet crucial operation of every database management system: equality testing. ...
The impact of state merging on predictive accuracy in probabilistic tree automata: Dietze's conjecture revisited
Dietze's conjecture concerns the problem of equipping a tree automaton M with weights to make it probabilistic, in such a way that the resulting automaton N predicts a given corpus C as accurately as possible. The conjecture states that the ...
