Designing FPT Algorithms for Cut Problems Using Randomized Contractions
From MaRDI portal
Publication:3187169
DOI10.1137/15M1032077zbMath1348.68063arXiv1207.4079MaRDI QIDQ3187169
Marek Cygan, Marcin Pilipczuk, Rajesh Chitnis, Michał Pilipczuk, Mohammad Taghi Hajiaghayi
Publication date: 16 August 2016
Published in: SIAM Journal on Computing (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1207.4079
fixed-parameter tractability; graph separations problems; randomized contractions; unique label cover
68Q25: Analysis of algorithms and problem complexity
68W40: Analysis of algorithms
05C85: Graph algorithms (graph-theoretic aspects)
68W20: Randomized algorithms