Turnitin
降AI改写
早检测系统
早降重系统
Turnitin-UK版
万方检测-期刊版
维普编辑部版
Grammarly检测
Paperpass检测
checkpass检测
PaperYY检测
[كتاب][B] Fundamentals of parameterized complexity
RG Downey, MR Fellows - 2013 - Springer
Parameterized complexity/multivariate complexity algorithmics is an exciting field of modern
algorithm design and analysis, with a broad range of theoretical and practical aspects that …
algorithm design and analysis, with a broad range of theoretical and practical aspects that …
[كتاب][B] Parameterized algorithms
M Cygan, FV Fomin, Ł Kowalik, D Lokshtanov, D Marx… - 2015 - Springer
The goal of this textbook is twofold. First, the book serves as an introduction to the field of
parameterized algorithms and complexity accessible to graduate students and advanced …
parameterized algorithms and complexity accessible to graduate students and advanced …
Lower bounds based on the exponential-time hypothesis
Abstract The Exponential Time Hypothesis (ETH) is a conjecture stating that, roughly
speaking, n-variable 3-SAT cannot be solved in time 2 o (n). In this chapter, we prove lower …
speaking, n-variable 3-SAT cannot be solved in time 2 o (n). In this chapter, we prove lower …
[HTML][HTML] A survey on approximation in parameterized complexity: Hardness and algorithms
Parameterization and approximation are two popular ways of co** with NP-hard
problems. More recently, the two have also been combined to derive many interesting …
problems. More recently, the two have also been combined to derive many interesting …
A survey on the computational complexity of coloring graphs with forbidden subgraphs
For a positive integer k, ak‐coloring of a graph is a map** such that whenever. The
Coloring problem is to decide, for a given G and k, whether ak‐coloring of G exists. If k is …
Coloring problem is to decide, for a given G and k, whether ak‐coloring of G exists. If k is …
Parameterized algorithms for modular-width
It is known that a number of natural graph problems which are FPT parameterized by
treewidth become W-hard when parameterized by clique-width. It is therefore desirable to …
treewidth become W-hard when parameterized by clique-width. It is therefore desirable to …
[HTML][HTML] Towards fully multivariate algorithmics: Parameter ecology and the deconstruction of computational complexity
The aim of this article is to motivate and describe the parameter ecology program, which
studies how different parameters contribute to the difficulty of classical problems. We call for …
studies how different parameters contribute to the difficulty of classical problems. We call for …
Exploring the gap between treedepth and vertex cover through vertex integrity
For problems intractable on graphs of bounded treewidth, two graph parameters treedepth
and vertex cover number have been used to obtain fine-grained algorithmic and complexity …
and vertex cover number have been used to obtain fine-grained algorithmic and complexity …
[HTML][HTML] Parameterized problems complete for nondeterministic FPT time and logarithmic space
Let XNLP be the class of parameterized problems such that an instance of size n with
parameter k can be solved nondeterministically in time f (k) n O (1) and space f (k) …
parameter k can be solved nondeterministically in time f (k) n O (1) and space f (k) …
Improving vertex cover as a graph parameter
Parameterized algorithms are often used to efficiently solve NP-hard problems on graphs. In
this context, vertex cover is used as a powerful parameter for dealing with graph problems …
this context, vertex cover is used as a powerful parameter for dealing with graph problems …