The Schrijver problem is known to be complete in the complexity class PPA. We prove that it can be solved by a randomized algorithm with running time nO(1) · kO(k), hence it is fixed-parameter tractable with respect to the parameter k.
Apr 19, 2022 · The analysis involves structural results on intersecting families and on induced subgraphs of Kneser and Schrijver graphs.
A Fixed-Parameter Algorithm for the Schrijver Problem - DROPS
drops.dagstuhl.de › LIPIcs.IPEC.2022.16
Dec 14, 2022 · The Schrijver problem is known to be complete in the complexity class PPA. We prove that it can be solved by a randomized algorithm with running ...
The Schrijver problem is known to be complete in the complexity class $\mathsf{PPA}$. We prove that it can be solved by a randomized algorithm with running time ...
A fixed-parameter algorithm for the Schrijver problem. In this section we present our randomized fixed-parameter algorithm for the Schrijver problem. We ...
Haviv, A fixed-parameter algorithm for the Schrijver problem, in Proceedings of the 17th International Symposium on Parameterized and Exact Computation ...
Apr 14, 2022 · We present a randomized algorithm for the Kneser problem with running time n^{O(1)} \cdot k^{O(k)}. This shows that the problem is fixed-parameter tractable.
People also ask
What is a fixed parameter algorithm?
What is a fixed parameter?
The analysis involves structural results on intersecting families and on induced subgraphs of Kneser and Schrijver graphs. We also study the Agreeable-Set ...
Topics · Schrijver Graphs · Vertices · Chromatic Number · Induced Subgraph · Randomized Algorithms · Fixed-Parameter Algorithms · Fixed-parameter Tractable · Kneser ...
Bibliographic details on A Fixed-Parameter Algorithm for the Schrijver Problem.