On the NP-Completeness of Some Graph Cluster Measures

Reference:

Jiří Šíma and Satu Elisa Schaeffer. On the NP-completeness of some graph cluster measures. In Jiří Wiedermann, Gerard Tel, Jarslav Pokorný, Mária Bieliková, and Július Štuller, editors, Proceedings of the Thirty-second International Conference on Current Trends in Theory and Practice of Computer Science (Sofsem 06), volume 3831 of Lecture Notes in Computer Science, pages 530–537, BerlinHeidelberg, Germany, 2006. Springer-Verlag GmbH.

Suggested BibTeX entry:

@inproceedings{SiSc06,
    address = {Berlin$\slash$Heidelberg, Germany},
    author = {Ji{\v{r}}{\'{\i}} {\v{S}}{\'{\i}}ma and Satu Elisa Schaeffer},
    booktitle = {Proceedings of the Thirty-second International Conference on Current Trends in Theory and Practice of Computer Science (Sofsem 06)},
    editor = {Ji{\v{r}}{\'{i}} Wiedermann and Gerard Tel and Jarslav Pokorn{\'{y}} and M{\'{a}}ria Bielikov{\'{a}} and J{\'{u}}lius {\v{S}}tuller},
    pages = {530--537},
    publisher = {Springer-Verlag GmbH},
    series = {Lecture Notes in Computer Science},
    title = {On the {NP}-Completeness of Some Graph Cluster Measures},
    volume = {3831},
    year = {2006},
}