Irredundant Set Faster Than O(2 n )

DOI10.1007/978-3-642-13073-1_26zbMath1284.05279OpenAlexW2033467899MaRDI QIDQ3563010

Jakub Onufry Wojtaszczyk, Marek Cygan, Marcin Pilipczuk

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_26

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (3)

Enumeration of minimal tropical connected sets ⋮ Breaking the \(2^{n}\)-barrier for irredundance: two lines of attack ⋮ Moderately exponential time algorithms for the maximum induced matching problem

This page was built for publication: Irredundant Set Faster Than O(2 n )