Branching and Treewidth Based Exact Algorithms

DOI10.1007/11940128_4zbMath1135.68513OpenAlexW1593174338WikidataQ60488759 ScholiaQ60488759MaRDI QIDQ5459098

Fedor V. Fomin, Saket Saurabh, Serge Gaspers

Publication date: 24 April 2008

Published in: Algorithms and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/11940128_4

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (11)

Maximum Minimal Vertex Cover Parameterized by Vertex Cover ⋮ A Multivariate Approach for Weighted FPT Algorithms ⋮ An Efficient Fixed-Parameter Enumeration Algorithm for Weighted Edge Dominating Set ⋮ A multivariate framework for weighted FPT algorithms ⋮ Maximum Minimal Vertex Cover Parameterized by Vertex Cover ⋮ On the parameterized complexity of the acyclic matching problem ⋮ Exact Algorithms for Edge Domination ⋮ Exact algorithms for maximum weighted independent set on sparse graphs (extended abstract) ⋮ A new distributed approximation algorithm for the maximum weight independent set problem ⋮ Improved approximation bounds for edge dominating set in dense graphs ⋮ On two techniques of combining branching and treewidth

This page was built for publication: Branching and Treewidth Based Exact Algorithms