Results 11 to 20 of about 128,668 (237)
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 +7 more sources
Parameterized Complexity Dichotomy for Steiner Multicut [PDF]
Journal of Computer and System Sciences, 2014 The Steiner Multicut problem asks, given an undirected graph G, terminals sets T1,...,Tt $\subseteq$ V(G) of size at most p, and an integer k, whether there is a set S of at most k edges or nodes s.t.
Bringmann, Karl +3 more
core +18 more sources
Model-Checking Problems as a Basis for Parameterized Intractability [PDF]
Logical Methods in Computer Science, 2005 Most parameterized complexity classes are defined in terms of a parameterized version of the Boolean satisfiability problem (the so-called weighted satisfiability problem). For example, Downey and Fellow's W-hierarchy is of this form.
Joerg Flum, Martin Grohe
doaj +4 more sources
The parameterized space complexity of model-checking bounded variable first-order logic [PDF]
Logical Methods in Computer Science, 2019 The parameterized model-checking problem for a class of first-order sentences (queries) asks to decide whether a given sentence from the class holds true in a given relational structure (database); the parameter is the length of the sentence.
Yijia Chen +2 more
doaj +6 more sources
Parameterized complexity of synchronization and road coloring [PDF]
Discrete Mathematics & Theoretical Computer Science, 2015 Automata, Logic and ...
Vojtěch Vorel, Adam Roman
doaj +2 more sources
The Complexity of Planning Revisited - A Parameterized Analysis [PDF]
, 2012 The early classifications of the computational complexity of planning under various restrictions in STRIPS (Bylander) and SAS+ (Baeckstroem and Nebel) have influenced following research in planning in many ways. We go back and reanalyse their subclasses,
Baeckstroem, Christer +4 more
core +3 more sources
On the parameterized complexity of computing tree-partitions [PDF]
Discrete Mathematics & Theoretical Computer ScienceWe study the parameterized complexity of computing the tree-partition-width, a graph parameter equivalent to treewidth on graphs of bounded maximum degree.
Hans L. Bodlaender +2 more
doaj +7 more sources
Parameterized Complexity of Secluded Connectivity Problems [PDF]
, 2015 The Secluded Path problem models a situation where a sensitive information has to be transmitted between a pair of nodes along a path in a network. The measure of the quality of a selected path is its exposure, which is the total weight of vertices in ...
Fomin, Fedor V. +3 more
core +6 more sources
On the Parameterized Complexity of Reconfiguration Problems [PDF]
Algorithmica, 2016 We present the first results on the parameterized complexity of reconfiguration problems, where a reconfiguration version of an optimization problem $Q$ takes as input two feasible solutions $S$ and $T$ and determines if there is a sequence of {\em reconfiguration steps} that can be applied to transform $S$ into $T$ such that each step results in a ...
Amer E. Mouawad +4 more
openalex +6 more sources
Parameterized Complexity Results for a Model of Theory of Mind Based on Dynamic Epistemic Logic [PDF]
Electronic Proceedings in Theoretical Computer Science, 2016 In this paper we introduce a computational-level model of theory of mind (ToM) based on dynamic epistemic logic (DEL), and we analyze its computational complexity. The model is a special case of DEL model checking.
Iris van de Pol +2 more
doaj +3 more sources