r-Simple k-Path and Related Problems Parameterized by k/r
Abstract
References
Index Terms
- r-Simple k-Path and Related Problems Parameterized by k/r
Recommendations
On r-Simple k-Path and related problems parameterized by k/r
SODA '19: Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete AlgorithmsAbasi et al. (2014) introduced the following two problems. In the r-Simple k-Path problem, given a digraph G on n vertices and positive integers r, k, decide whether G has an r-simple k-path, which is a walk where every vertex occurs at most r times and ...
Parameterized Complexity Dichotomy for (r, ℓ)-Vertex Deletion
For two integers r, ℓ ź 0, a graph G = (V, E) is an (r, ℓ)-graph if V can be partitioned into r independent sets and ℓ cliques. In the parameterized (r, ℓ)-Vertex Deletion problem, given a graph G and an integer k, one has to decide whether at most k ...
Parameterized Bounded-Depth Frege Is not Optimal
A general framework for parameterized proof complexity was introduced by Dantchev et al. [2007]. There, the authors show important results on tree-like Parameterized Resolution---a parameterized version of classical Resolution---and their gap complexity ...
Comments
Information & Contributors
Information
Published In
Publisher
Association for Computing Machinery
New York, NY, United States
Publication History
Check for updates
Author Tags
Qualifiers
- Research-article
- Research
- Refereed
Funding Sources
- Royal Society Wolfson Research Merit Award and Leverhulme Trust
- Israel Science Foundation (ISF)
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- 0Total Citations
- 118Total Downloads
- Downloads (Last 12 months)9
- Downloads (Last 6 weeks)0
Other Metrics
Citations
View Options
Get Access
Login options
Check if you have access through your login credentials or your institution to get full access on this article.
Sign inFull Access
View options
View or Download as a PDF file.
PDFeReader
View online with eReader.
eReaderHTML Format
View this article in HTML Format.
HTML Format