Isolation concepts for clique enumeration: comparison and computational experiments
From MaRDI portal
Publication:1040581
DOI10.1016/j.tcs.2009.05.008zbMath1192.68484MaRDI QIDQ1040581
Rolf Niedermeier, Christian Komusiewicz, Hannes Moser, Falk Hüffner
Publication date: 25 November 2009
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2009.05.008
exact algorithm; NP-hard problem; fixed-parameter tractability; dense subgraph; algorithm engineering
Uses Software