Kernel bounds for disjoint cycles and disjoint paths
From MaRDI portal
Publication:638521
DOI10.1016/j.tcs.2011.04.039zbMath1221.68099MaRDI QIDQ638521
Anders Yeo, Hans L. Bodlaender, Steéphan Thomassé
Publication date: 12 September 2011
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2011.04.039
algorithms; data reduction; fixed parameter complexity; lower bounds; kernelization; disjoint cycles
68Q25: Analysis of algorithms and problem complexity
68Q17: Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.)