Results 201 to 210 of about 128,668 (237)

On the (parameterized) complexity of recognizing well-covered (r,l)-graphs

open access: green, 2017
Sancrey Rodrigues Alves   +5 more
openalex   +2 more sources

Parameterized complexity of finding a spanning tree with minimum reload cost diameter

open access: green, 2017
Julien Baste   +5 more
openalex   +2 more sources

On the Parameterized Complexity of $k$-Edge Colouring

open access: green, 2019
Esther Galby   +3 more
openalex   +2 more sources

Parameterized Complexity of Conflict-free Graph Coloring

open access: green, 2019
Hans L. Bodlaender   +2 more
openalex   +2 more sources

Parameterized Random Complexity [PDF]

open access: possibleTheory of Computing Systems, 2011
The classes W[P] and W[1] are parameterized analogues of NP in that they can be characterized by machines with restricted existential nondeterminism. These machine characterizations give rise to two natural notions of parameterized randomized algorithms that we call W[P]-randomization and W[1]-randomization. This paper develops the corresponding theory.
Moritz Müller, Juan Andrés Montoya
openaire   +1 more source

The parameterized complexity of counting problems [PDF]

open access: possibleThe 43rd Annual IEEE Symposium on Foundations of Computer Science, 2002. Proceedings., 2003
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Jörg Flum, Martin Grohe
openaire   +2 more sources

Parameterized complexity for the skeptic [PDF]

open access: possible18th IEEE Annual Conference on Computational Complexity, 2003. Proceedings., 2004
The goal is to provide a tourist guide, with an eye towards structural issues, to what I consider some of the major highlights of parameterized complexity.
openaire   +1 more source

Home - About - Disclaimer - Privacy