Results 41 to 50 of about 11,104 (228)
On $r$-Guarding Thin Orthogonal Polygons [PDF]
, 2016 Guarding a polygon with few guards is an old and well-studied problem in computational geometry. Here we consider the following variant: We assume that the polygon is orthogonal and thin in some sense, and we consider a point $p$ to guard a point $q$ if ...
Biedl, Therese, Mehrabi, Saeed
core +2 more sources
Journal of Combinatorial Theory, Series B, 2007 25 ...
Chandran, LS, Sivadasan, N
openaire +2 more sources
Threshold Treewidth and Hypertree Width [PDF]
Journal of Artificial Intelligence Research, 2020 Treewidth and hypertree width have proven to be highly successful structural parameters in the context of the Constraint Satisfaction Problem (CSP). When either of these parameters is bounded by a constant, then CSP becomes solvable in polynomial time. However, here the order of the polynomial in the running time depends on the width, and this is known
Ganian, Robert +3 more
openaire +2 more sources
On Exploring Temporal Graphs of Small Pathwidth [PDF]
, 2018 We show that the Temporal Graph Exploration Problem is NP-complete, even when the underlying graph has pathwidth 2 and at each time step, the current graph is ...
Bodlaender, Hans L. +1 more
core +2 more sources
Tree-width for first order formulae [PDF]
Logical Methods in Computer Science, 2012 We introduce tree-width for first order formulae \phi, fotw(\phi). We show that computing fotw is fixed-parameter tractable with parameter fotw. Moreover, we show that on classes of formulae of bounded fotw, model checking is fixed parameter tractable ...
Isolde Adler, Mark Weyer
doaj +1 more source
Optimizing tree decompositions in MSO [PDF]
Logical Methods in Computer Science, 2022 The classic algorithm of Bodlaender and Kloks [J. Algorithms, 1996] solves the following problem in linear fixed-parameter time: given a tree decomposition of a graph of (possibly suboptimal) width k, compute an optimum-width tree decomposition of the ...
Mikołaj Bojańczyk, Michał Pilipczuk
doaj +1 more source
Discrete Applied Mathematics, 2004 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Bouchitté, Vincent +3 more
openaire +3 more sources
Parameterized Complexity of Equitable Coloring [PDF]
Discrete Mathematics & Theoretical Computer Science, 2019 A graph on $n$ vertices is equitably $k$-colorable if it is $k$-colorable and every color is used either $\left\lfloor n/k \right\rfloor$ or $\left\lceil n/k \right\rceil$ times.
Guilherme de C. M. Gomes +2 more
doaj +1 more source
A Trichotomy in the Complexity of Counting Answers to Conjunctive Queries [PDF]
, 2015 Conjunctive queries are basic and heavily studied database queries; in relational algebra, they are the select-project-join queries. In this article, we study the fundamental problem of counting, given a conjunctive query and a relational database, the ...
Chen, Hubie, Mengel, Stefan
core +3 more sources
Width, Depth, and Space: Tradeoffs between Branching and Dynamic Programming
Algorithms, 2018 Treedepth is a well-established width measure which has recently seen a resurgence of interest. Since graphs of bounded treedepth are more restricted than graphs of bounded tree- or pathwidth, we are interested in the algorithmic utility of this ...
Li-Hsuan Chen +3 more
doaj +1 more source