Results 31 to 40 of about 1,615,193 (298)
On the Descriptive Complexity of Color Coding
Algorithms, 2021 Color coding is an algorithmic technique used in parameterized complexity theory to detect “small” structures inside graphs. The idea is to derandomize algorithms that first randomly color a graph and then search for an easily-detectable, small color ...
Max Bannach, Till Tantau
doaj +1 more source
On the Parameterized Complexity of Consensus Clustering [PDF]
Theoretical Computer Science, 2011 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Martin Dörnfelder +3 more
openaire +4 more sources
On the parameterized complexity of computing tree-partitions [PDF]
, 2022 We study the parameterized complexity of computing the tree-partition-width, a graph parameter equivalent to treewidth on graphs of bounded maximum degree.
Bodlaender, Hans L. +2 more
core +1 more source
Parameterized streaming : maximal matching and vertex cover [PDF]
, 2014 As graphs continue to grow in size, we seek ways to effectively process such data at scale. The model of streaming graph processing, in which a compact summary is maintained as each edge insertion/deletion is observed, is an attractive one.
Chitnis, Rajesh; id_orcid +11 more
core +1 more source
Consistency Checking Problems: A Gateway to Parameterized Sample Complexity [PDF]
, 2023 Recently, Brand, Ganian and Simonov introduced a parameterized refinement of the classical PAC-learning sample complexity framework. A crucial outcome of their investigation is that for a very wide range of learning problems, there is a direct and ...
Ganian, Robert +2 more
core +1 more source
Counting Problems in Parameterized Complexity
Tsinghua Science and Technology, 2014 Parameterized complexity is a multivariate theory for the analysis of computational problems. It leads to practically efficient algorithms for many 𝐍𝐏-hard problems and also provides a much finer complexity classification for other intractable problems ...
Chihao Zhang, Yijia Chen
doaj +1 more source
Institutional complexity is complexity with an adjective
, 2021 A review of the studies on institutional complexity reveals that the many definitions of institutional complexity and related concepts share similarities with the understanding of complexity and complex systems of complexity science. Yet few publications
Papin, Marielle
core +1 more source
Parameterized Complexity Results for Bayesian Inference [PDF]
, 2022 We present completeness results for inference in Bayesian networks with respect to two different parameterizations, namely the number of variables and the topological vertex separation number.
Donselaar, Nils +2 more
core +2 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 +1 more source
09511 Open Problems – Parameterized complexity and approximation algorithms [PDF]
, 2010 The paper contains a list of the problems presented on Monday, December 14, 2009 at the open problem session of the Seminar on Parameterized Complexity and Approximation Algorithms, held at Schloss Dagstuhl in Wadern ...
Marx, Dániel +2 more
core +1 more source