TCS / Research / Publications / On the \np-Completeness of Some Graph Cluster Measures
Helsinki University of Technology, 
     Laboratory for Theoretical Computer Science

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. Technical Report cs.CC/0506100, arXiv.org e-Print archive, http://arxiv.org/, June 2005.

Suggested BibTeX entry:

@techreport{SiSc05,
    address = {\url{http://arxiv.org/}},
    author = {Ji{\v{r}}{\'{\i}} {\v{S}}{\'{\i}}ma and Satu Elisa Schaeffer},
    institution = {arXiv.org e-Print archive},
    month = {June},
    number = {cs.CC/0506100},
    pages = {9},
    title = {On the \np-Completeness of Some Graph Cluster Measures},
    type = {Technical Report},
    year = {2005},
}

This work is not available online here.

[TCS main] [Contact Info] [Personnel] [Research] [Publications] [Software] [Studies] [News Archive] [Links]
Latest update: 19 January 2010.