Breaking the <mml:math altimg="si1.gif" overflow="scroll" xmlns:xocs="http://www.elsevier.com/xml/xocs/dtd" xmlns:xs="http://www.w3.org/2001/XMLSchema" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xmlns="http://www.elsevier.com/xml/ja/dtd" xmlns:ja="http://www.elsevier.com/xml/ja/dtd" xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:tb="http://www.elsevier.com/xml/common/table/dtd" xmlns:sb="http://www.elsevier.com/xml/common/struct-bib/dtd" xmlns:ce="http://www.elsevier.com/xml/common/dtd" xmlns:xlink="http://www.w3.org/1999/xlink" xmlns:cals="http://www.elsevier.com/xml/common/cals/dtd"><mml:msup><mml:mn>2</mml:mn><mml:mi>n</mml:mi></mml:msup></mml:math>-barrier for Irredundance: Two lines of attack-Reference-Cited by-同舟云学术

Breaking the 2n-barrier for Irredundance: Two lines of attack

Published:2011-09 Issue:3 Volume:9 Page:214-230
ISSN:1570-8667
Container-title:Journal of Discrete Algorithms
language:en
Short-container-title:Journal of Discrete Algorithms

Author:

Binkele-Raible Daniel,Brankovic Ljiljana,Cygan Marek,Fernau Henning,Kneis Joachim,Kratsch Dieter,Langer Alexander,Liedloff Mathieu,Pilipczuk Marcin,Rossmanith Peter,Wojtaszczyk Jakub Onufry

Publisher

Elsevier BV

Subject

Computational Theory and Mathematics,Discrete Mathematics and Combinatorics,Theoretical Computer Science

Reference38 articles.

1. Kernels: annotated, proper and induced;Abu-Khzam,2006

2. On domination and independent domination numbers of a graph;Allan;Discrete Mathematics,1978

3. D. Binkele-Raible, Amortized analysis of exponential-time and parameterized algorithms: Measure & conquer and reference search trees, PhD thesis, Abteilung Informatik – Wirtschaftsinformatik, 2010.

4. A parameterized route to exact puzzles: breaking the 2n-barrier for irredundance;Binkele-Raible,2010

5. The Travelling Salesman Problem in bounded degree graphs;Björklund,2008

Cited by 18 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Solving Target Set Selection with Bounded Thresholds Faster than $$2^n$$;Algorithmica;2022-09-14

2. Irredundance;Developments in Mathematics;2020-09-15

3. Domination chain: Characterisation, classical complexity, parameterised complexity and approximability;Discrete Applied Mathematics;2020-06

4. Enumeration and maximum number of maximal irredundant sets for chordal graphs;Discrete Applied Mathematics;2019-07

5. Enumeration of maximal irredundant sets for claw-free graphs;Theoretical Computer Science;2019-01