A Parameterized Route to Exact Puzzles: Breaking the 2 n -Barrier for Irredundance

DOI10.1007/978-3-642-13073-1_28zbMath1284.05266OpenAlexW2094015401MaRDI QIDQ3563012

Dieter Kratsch, Henning Fernau, Alexander Langer, Ljiljana Brankovic, Joachim Kneis, Daniel Binkele-Raible, Mathieu Liedloff, Peter Rossmanith

Publication date: 28 May 2010

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-13073-1_28

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Nonnumerical algorithms (68W05) Graph algorithms (graph-theoretic aspects) (05C85) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Related Items (2)

Breaking the \(2^{n}\)-barrier for irredundance: two lines of attack ⋮ An exact exponential-time algorithm for the directed maximum leaf spanning tree problem

This page was built for publication: A Parameterized Route to Exact Puzzles: Breaking the 2 n -Barrier for Irredundance