Iterative Expansion and Color Coding
From MaRDI portal
Publication:3189047
DOI10.1145/2071379.2071385zbMath1295.68231OpenAlexW2010011156MaRDI QIDQ3189047
Sing-Hoi Sze, Yang Liu, Songjian Lu, Fenghui Zhang, Jian'er Chen
Publication date: 9 September 2014
Published in: ACM Transactions on Algorithms (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/2071379.2071385
Analysis of algorithms and problem complexity (68Q25) Analysis of algorithms (68W40) Nonnumerical algorithms (68W05)
Related Items (8)
Randomized parameterized algorithms for the kidney exchange problem ⋮ Parameterized approximation algorithms for packing problems ⋮ Parameterized counting matching and packing: a family of hard problems that admit FPTRAS ⋮ Deterministic Algorithms for Matching and Packing Problems Based on Representative Sets ⋮ The control complexity of \(r\)-Approval: from the single-peaked case to the general case ⋮ Parameterized Complexity of Independent Set in H-Free Graphs. ⋮ The \(k\)-distinct language: parameterized automata constructions ⋮ Parameterized complexity of independent set in H-free graphs
This page was built for publication: Iterative Expansion and Color Coding
