Suchergebnisse - "Fixed parameter complexity"

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

“… The problem of maximizing the p th power of a p -norm over a halfspace-presented polytope in R d is a convex maximization problem which plays a fundamental …”
Volltext

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

“… A λ-labeling of a graph G is an assignment of labels from the set {0,…, λ} to the vertices of G such that vertices at distance of at most two get different …”
Volltext

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

“… Many relevant intractable problems become tractable if some problem parameter is fixed. However, various problems exhibit very different computational …”
Volltext

On the fixed parameter complexity of graph enumeration problems definable in monadic second-order logic von 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 …”
Volltext

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

“… The profile of a graph is an integer-valued parameter defined via vertex orderings; it is known that the profile of a graph equals the smallest number of edges …”
Volltext

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

Volltext

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

“… In this paper, we show that the problems Disjoint Cycles and Disjoint Paths do not have polynomial kernels, unless N P ⊆ c o N P / p o l y . Thus, these …”
Volltext

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

“… The Grundy number of a graph G , denoted by Γ ( G ), is the largest k such that G has a greedy k -colouring, that is a colouring with k colours obtained by …”
Volltext

Ranking chain sum orders von 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 …”
Volltext

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

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

Branch-width, parse trees, and monadic second-order logic for matroids von 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 …”
Volltext

On the fixed parameter complexity of graph enumeration problems definable in monadic second-order logic: International Workshop on Graph-Theoretic Concepts in Computer Science, WG'98, Selected Papers von COURCELLE, B, MAKOWSKY, J. A, ROTICS, U

Volltext

Monadic second-order model-checking on decomposable matroids von Strozecki, Yann

“… A notion of branch-width, which generalizes the one known for graphs, can be defined for matroids. We first give a proof of the polynomial time model-checking …”
Volltext

Parameterized complexity of k-anonymity: hardness and tractability von Bonizzoni, Paola, Della Vedova, Gianluca, Dondi, Riccardo, Pirola, Yuri

“… The problem of publishing personal data without giving up privacy is becoming increasingly important. A precise formalization that has been recently proposed …”
Volltext

Minimal unsatisfiable formulas with bounded clause-variable difference are fixed-parameter tractable von Szeider, Stefan

“… Recognition of minimal unsatisfiable CNF formulas (unsatisfiable CNF formulas which become satisfiable if any clause is removed) is a classical D P -complete …”
Volltext

Fixed parameter complexity of distance constrained labeling and uniform channel assignment problems von Fiala, Jiří, Gavenčiak, Tomáš, Knop, Dušan, Koutecký, Martin, Kratochvíl, Jan

“… We study computational complexity of the class of distance-constrained graph labeling problems from the fixed parameter tractability point of view. The …”
Volltext

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

“… The problem of maximizing the \(p\)-th power of a \(p\)-norm over a halfspace-presented polytope in \(\R^d\) is a convex maximization problem which plays a …”
Volltext

The complexity of the matroid–greedoid partition problem von Asodi, Vera, Umans, Christopher

“… We show that the maximum matroid–greedoid partition problem is NP-hard to approximate to within 1 / 2 + ε for any ε > 0 , which matches the trivial factor 1/2 …”
Volltext

Kernels in planar digraphs von Gutin, Gregory, Kloks, Ton, Lee, Chuan Min, Yeo, Anders

“… A set S of vertices in a digraph D = ( V , A ) is a kernel if S is independent and every vertex in V - S has an out-neighbor in S. We show that there exist O ( …”
Volltext

Simplifying the weft hierarchy von Buss, Jonathan F., Islam, Tarique

“… We give simple, self-contained proofs of the basic hardness results for the classes W [ t ] of the weft hierarchy. We extend these proofs to higher levels of …”
Volltext