The complexity of finding effectors

DOI10.1007/978-3-319-17142-5_20MaRDI QIDQ6826765zbMATH OpenFDO

Authors Laurent Bulteau, Stefan Fafianie, Vincent Froese, Rolf Niedermeier, Nimrod Talmon

Publication date 30 September 2015

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Probability in computer science (algorithm analysis, random structures, phase transitions, etc.) (68Q87) Graph theory (including graph drawing) in computer science (68R10) Social networks; opinion dynamics (91D30) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

This page was built for publication: The complexity of finding effectors

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6826765)