Results 81 to 90 of about 3,161 (171)

LTL Fragments are Hard for Standard Parameterisations

, 2015
We classify the complexity of the LTL satisfiability and model checking problems for several standard parameterisations. The investigated parameters are temporal depth, number of propositional variables and formula treewidth, resp., pathwidth.
Lück, Martin, Meier, Arne
core   +1 more source

Hitting minors, subdivisions, and immersions in tournaments

, 2018
The Erd\H{o}s-P\'osa property relates parameters of covering and packing of combinatorial structures and has been mostly studied in the setting of undirected graphs.
Raymond, Jean-Florent
core   +1 more source

$n$-permutability and linear Datalog implies symmetric Datalog

, 2018
We show that if $\mathbb A$ is a core relational structure such that CSP($\mathbb A$) can be solved by a linear Datalog program, and $\mathbb A$ is $n$-permutable for some $n$, then CSP($\mathbb A$) can be solved by a symmetric Datalog program (and thus ...
Kazda, Alexandr
core   +1 more source

Forbidden Directed Minors and Kelly-width [PDF]

, 2014
Partial 1-trees are undirected graphs of treewidth at most one. Similarly, partial 1-DAGs are directed graphs of KellyWidth at most two. It is well-known that an undirected graph is a partial 1-tree if and only if it has no K_3 minor.
Kintali, Shiva, Zhang, Qiuyi
core  

Visibility Representations of Boxes in 2.5 Dimensions

, 2016
We initiate the study of 2.5D box visibility representations (2.5D-BR) where vertices are mapped to 3D boxes having the bottom face in the plane $z=0$ and edges are unobstructed lines of sight parallel to the $x$- or $y$-axis.
A Gupta, AM Dean, AM Dean, AM Dean, AM Dean, AM Dean, E Di Giacomo, F Brandenburg, FJ Cobos, G Kant, G Liotta, I Streinu, J Štola, JD Kleitman, JP Hutchinson, ME Ahmed, MR Garey, P Bose, P Bose, P Carmi, P Duchet, P Rosenstiehl, R Tamassia, R Tamassia, S Felsner, S Sultana, SP Fekete, T Akiyama, T Bruckdorfer, W Evans   +29 more
core   +1 more source

Tournament pathwidth and topological containment

Journal of Combinatorial Theory, Series B, 2013
We prove that if a tournament has pathwidth >=4@q^2+7@q then it has @q vertices that are pairwise @q-connected. As a consequence of this and previous results, we obtain that for every set S of tournaments the following are equivalent:*there exists k such that every member of S has pathwidth at most k, *there is a digraph H such that no subdivision of H
Paul Seymour, Alexandra Fradkin
openaire   +2 more sources

Does Treewidth Help in Modal Satisfiability?

, 2010
Many tractable algorithms for solving the Constraint Satisfaction Problem (CSP) have been developed using the notion of the treewidth of some graph derived from the input CSP instance.
A. Herzig, B. Cate ten, B. Courcelle, E. Fischer, G. Pan, G. Pan, H. Chen, H.L. Bodlaender, H.L. Bodlaender, I. Adler, J. Flum, J.H. Reif, J.Y. Halpern, J.Y. Halpern, M. Fellows, M. Grohe, M. Samer, M.Y. Vardi, P. Blackburn, P. Enjalbert, R. Fagin, R.E. Ladner, V. Dalmau, V.R. Pratt, Y. Kazakov   +24 more
core   +1 more source

Parameterized Compilation Lower Bounds for Restricted CNF-formulas

, 2016
We show unconditional parameterized lower bounds in the area of knowledge compilation, more specifically on the size of circuits in decomposable negation normal form (DNNF) that encode CNF-formulas restricted by several graph width measures.
A Darwiche, A Darwiche, C Muise, I Razgon, J Flum, M Lampis, M Thurley, P Duris, R Diestel, R Haan de, S Bova, S Ordyniak, SH Sæther   +12 more
core   +1 more source

Editorial. [PDF]

Theor Comput Sci, 2022
Calamoneri T.
europepmc   +1 more source

Anagram-free Graph Colouring

, 2017
An anagram is a word of the form $WP$ where $W$ is a non-empty word and $P$ is a permutation of $W$. We study anagram-free graph colouring and give bounds on the chromatic number. Alon et al.
Wilson, Tim E., Wood, David R.
core