Exact combinatorial algorithms and experiments for finding maximum \(k\)-plexes
From MaRDI portal
Publication:1928521
DOI10.1007/s10878-011-9391-5zbMath1261.90081MaRDI QIDQ1928521
Rolf Niedermeier, Manuel Sorge, Hannes Moser
Publication date: 3 January 2013
Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10878-011-9391-5
social network analysis; parameterized algorithmics; dense subgraphs; NP-complete graph problems; \(k\)-dependent sets; \(s\)-plexes; biological network analysis
Uses Software