Irredundant Set Faster Than O(2 n )
From MaRDI portal
Publication:3563010
DOI10.1007/978-3-642-13073-1_26zbMath1284.05279MaRDI QIDQ3563010
Marek Cygan, Marcin Pilipczuk, Jakub Onufry Wojtaszczyk
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
68Q25: Analysis of algorithms and problem complexity
05C85: Graph algorithms (graph-theoretic aspects)