TU Berlin

Research Group Algorithmics and Computational ComplexityThe complexity of finding a large subgraph under anonymity constraints

isti-logo

Page Content

to Navigation

Conference paper

Robert Bredereck and Sepp Hartung and André Nichterlein and Gerhard Woeginger.
The complexity of finding a large subgraph under anonymity constraints.
In Proceedings of the 24th International Symposium on Algorithms and Computation (ISAAC '13), pages 152–162. Springer, 2013.
Bibtex entry Link to publication
Link to original publication

Navigation

Quick Access

Schnellnavigation zur Seite über Nummerneingabe