Pages that link to "Item:Q635734"

The following pages link to Breaking the \(2^{n}\)-barrier for irredundance: two lines of attack (Q635734):

Displaying 14 items.

• An exact exponential-time algorithm for the directed maximum leaf spanning tree problem (Q450578) (← links)
• Scheduling partially ordered jobs faster than \(2^n\) (Q528859) (← links)
• On the number of connected sets in bounded degree graphs (Q1627210) (← links)
• Enumeration of maximal irredundant sets for claw-free graphs (Q1628586) (← links)
• The many facets of upper domination (Q1704853) (← links)
• Exact and parameterized algorithms for \textsc{Max Internal Spanning Tree} (Q1939668) (← links)
• Domination chain: characterisation, classical complexity, parameterised complexity and approximability (Q2181241) (← links)
• Moderately exponential time algorithms for the maximum induced matching problem (Q2355320) (← links)
• Computing the differential of a graph: hardness, approximability and exact algorithms (Q2448922) (← links)
• Solving target set selection with bounded thresholds faster than \(2^n\) (Q2684482) (← links)
• On the Complexity Landscape of the Domination Chain (Q2795935) (← links)
• Algorithmic Aspects of Upper Domination: A Parameterised Perspective (Q2830063) (← links)
• Irredundance (Q3384112) (← links)
• Solving Target Set Selection with Bounded Thresholds Faster than 2^n (Q5009485) (← links)