Results 11 to 20 of about 1,864,097 (296)

Parameterized parallel complexity [PDF]

open access: yes, 1998
We introduce a framework to study the parallel complexity of parameterized problems, and we propose some analogs of ...
Cesati M.   +3 more
core   +5 more sources

On the parameterized complexity of computing tree-partitions [PDF]

open access: yesDiscrete Mathematics & Theoretical Computer Science, 2022
We study the parameterized complexity of computing the tree-partition-width, a graph parameter equivalent to treewidth on graphs of bounded maximum degree.
Hans L. Bodlaender   +2 more
doaj   +3 more sources

Parameterized Complexity of Scheduling Chains of Jobs with Delays [PDF]

open access: yes, 2020
In this paper, we consider the parameterized complexity of the following scheduling problem. We must schedule a number of jobs on m machines, where each job has unit length, and the graph of precedence constraints consists of a set of chains.
Wegen, Marieke van der   +6 more
core   +3 more sources

Parameterized Proof Complexity [PDF]

open access: yescomputational complexity, 2007
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Stefan S. Dantchev   +2 more
openaire   +2 more sources

On the parameterized complexity of Grid Contraction

open access: yesJournal of Computer and System Sciences, 2022
For a family of graphs $\mathcal{G}$, the $\mathcal{G}$-\textsc{Contraction} problem takes as an input a graph $G$ and an integer $k$, and the goal is to decide if there exists $F \subseteq E(G)$ of size at most $k$ such that $G/F$ belongs to $\mathcal{G}$. Here, $G/F$ is the graph obtained from $G$ by contracting all the edges in $F$. In this article,
Saket Saurabh 0001   +2 more
openaire   +9 more sources

Parameterized Complexity of Diameter [PDF]

open access: yesAlgorithmica, 2019
AbstractDiameter—the task of computing the length of a longest shortest path—is a fundamental graph problem. Assuming the Strong Exponential Time Hypothesis, there is no $$O(n^{1.99})$$ O ( n 1.99
Bentert, Matthias, Nichterlein , André
openaire   +6 more sources

Quantum Parameterized Complexity

open access: yesCoRR, 2022
23 pages, 1 ...
Michael J. Bremner   +5 more
openaire   +2 more sources

Computing nash equilibria gets harder : new results show hardness even for parameterized complexity [PDF]

open access: yes, 2009
In this paper we show that some decision problems regarding the computation of Nash equilibria are to be considered particularly hard. Most decision problems regarding Nash equilibria have been shown to be NP-complete. While some NP-complete problems can
Parsa, Mahdi, Estivill-Castro, Vladimir
core   +3 more sources

Parameterized Complexity of Broadcasting in Graphs

open access: yesTheoretical Computer Science, 2023
The task of the broadcast problem is, given a graph G and a source vertex s, to compute the minimum number of rounds required to disseminate a piece of information from s to all vertices in the graph. It is assumed that, at each round, an informed vertex can transmit the information to at most one of its neighbors.
Fomin, Fedor   +2 more
openaire   +7 more sources

Parameterized Complexity of Streaming Diameter and Connectivity Problems [PDF]

open access: yes, 2022
We initiate the investigation of the parameterized complexity of Diameter and Connectivity in the streaming paradigm. On the positive end, we show that knowing a vertex cover of size k allows for algorithms in the Adjacency List (AL) streaming model ...
van Leeuwen, Erik Jan   +7 more
core   +1 more source

Home - About - Disclaimer - Privacy