Search Results - Fixed parameter complexity

Fixed-parameter decidability: Extending parameterized complexity analysis: Fixed-Parameter decidability by Witteveen, Jouke, Torenvliet, Leen

Get full text

Fixed-parameter complexity of λ-labelings by Fiala, Jiřı́, Kloks, Ton, Kratochvı́l, Jan

“… We study the minimum value λ= λ( G) such that G admits a λ-labeling. We show that for every fixed value k…”
Get full text

Fixed-Parameter Complexity and Approximability of Norm Maximization by Knauer, Christian, König, Stefan, Werner, Daniel

“… In this paper, we use the theory of parameterized complexity to analyze how heavily the hardness of norm maximization relies on the parameter d…”
Get full text

Fixed-parameter decidability: Extending parameterized complexity analysis by Witteveen, Jouke, Torenvliet, Leen

“…We extend the reach of fixed‐parameter analysis by introducing classes of parameterized sets defined based on decidability instead of complexity…”
Get full text

Fixed-parameter complexity in AI and nonmonotonic reasoning by Gottlob, Georg, Scarcello, Francesco, Sideri, Martha

“… The theory of parameterized complexity deals with such issues, and provides general techniques for identifying fixed-parameter tractable and fixed-parameter intractable problems…”
Get full text

On the complexity of fixed parameter clique and dominating set by Eisenbrand, Friedrich, Grandoni, Fabrizio

“…We provide simple, faster algorithms for the detection of cliques and dominating sets of fixed order…”
Get full text

On the fixed parameter complexity of graph enumeration problems definable in monadic second-order logic by Courcelle, B., Makowsky, J.A., Rotics, U.

“…We discuss the parametrized complexity of counting and evaluation problems on graphs where the range of counting is definable in monadic second-order logic (MSOL…”
Get full text

Fixed-Parameter Complexity of Minimum Profile Problems by Gutin, Gregory, Szeider, Stefan, Yeo, Anders

“… −1 is a tight lower bound for the profile. We present two fixed-parameter algorithms for this problem…”
Get full text

Fixed-Parameter Complexity of Minimum Profile Problems: Parameterized and Exact Algorithms by GUTIN, Gregory, SZEIDER, Stefan, YEO, Anders

Get full text

Scaffolding Problems Revisited: Complexity, Approximation and Fixed Parameter Tractable Algorithms, and Some Special Cases by Weller, Mathias, Chateau, Annie, Dallard, Clément, Giroudeau, Rodolphe

“…This paper is devoted to new results about the scaffolding problem, an integral problem of genome inference in bioinformatics. The problem consists in finding…”
Get full text

Kernel bounds for disjoint cycles and disjoint paths by Bodlaender, Hans L., Thomassé, Stéphan, Yeo, Anders

“… . Thus, these problems do not allow polynomial time preprocessing that results in instances whose size is bounded by a polynomial in the parameter at hand…”
Get full text

Parameterized complexity of multiwinner determination: more effort towards fixed-parameter tractability by Yang, Yongjie, Wang, Jianxin

“… Although they have been studied from the parameterized complexity point of view with respect to several natural parameters, many of them turned out to be W[1]-hard or W[2]-hard…”
Get full text

The complexity of quantum circuit mapping with fixed parameters by Zhu, Pengcheng, Zheng, Shenggen, Wei, Lihua, Cheng, Xueyun, Guan, Zhijin, Feng, Shiguang

“… The complexity of QCM with fixed parameters is studied in the paper. We give an exact algorithm for QCM, and show that the algorithm runs in polynomial time if the NISQ…”
Get full text

On the Grundy and b-Chromatic Numbers of a Graph by Havet, Frédéric, Sampaio, Leonardo

“… . We then show that deciding if Γ ( G )≥| V ( G )|− k or if χ b ( G )≥| V ( G )|− k are fixed parameter tractable problems with respect to the parameter k …”
Get full text

On the Complexity of Some Geometric Problems With Fixed Parameters by Schaefer, Marcus

“…) as long as the parameter $k$ is unbounded. Do they remain ${\exists \mathbb{R}}$-complete for a fixed value $k$? Do $k…”
Get full text

Ranking chain sum orders by Brandenburg, Franz J., Gleißner, Andreas

“…Ranking information is an important topic in information sciences, Internet searching, voting systems, and sports. In the full information approach, a ranking…”
Get full text

Monotone Arithmetic Complexity of Graph Homomorphism Polynomials by Komarath, Balagopal, Pandey, Anurag, Rahul, C. S.

“… families which are complete for algebraic complexity classes VBP , V P , and VNP . We discover that, in the monotone setting, the formula complexity, the ABP complexity…”
Get full text

Coloured Tutte polynomials and Kauffman brackets for graphs of bounded tree width by Makowsky, J.A.

“…Tutte polynomials are important graph invariants with rich applications in combinatorics, topology, knot theory, coding theory and even physics. The Tutte…”
Get full text

The Complexity Landscape of Fixed-Parameter Directed Steiner Network Problems by Feldmann, Andreas Emil, Marx, Daniel

“… (when we ask for paths from a root \(r\) to terminals \(t_1,\dots,t_d\)) is known to be fixed-parameter tractable parameterized by the number of terminals, while the special case Strongly Connected Steiner Subgraph…”
Get full text

Branch-width, parse trees, and monadic second-order logic for matroids by Hliněný, Petr

“…We introduce “matroid parse trees” which, using only a limited amount of information at each node, can build up the vector representations of matroids of…”
Get full text