Randomized Disposal of Unknowns and Implicitly Enforced Bounds on Parameters

DOI10.1007/978-3-540-79723-4_1zbMath1142.68598OpenAlexW1597444706MaRDI QIDQ3503572

Jian'er Chen

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

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Nonnumerical algorithms (68W05)

Related Items (1)

Parameterized random complexity

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