Randomized Disposal of Unknowns and Implicitly Enforced Bounds on Parameters
From MaRDI portal
Publication:3503572
DOI10.1007/978-3-540-79723-4_1zbMath1142.68598OpenAlexW1597444706MaRDI QIDQ3503572
Publication date: 5 June 2008
Published in: Parameterized and Exact Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-540-79723-4_1
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Finding odd cycle transversals.
- Using nondeterminism to design efficient deterministic algorithms
- Divide-and-Color
- Improved Algorithms for the Feedback Vertex Set Problems
- An Improved Parameterized Algorithm for the Minimum Node Multiway Cut Problem
- Improved Algorithms for Weighted and Unweighted Set Splitting Problems
- Color-coding
- Parameterized and Exact Computation
- Subexponential Parameterized Algorithms
- Graph-Theoretic Concepts in Computer Science
This page was built for publication: Randomized Disposal of Unknowns and Implicitly Enforced Bounds on Parameters