Number of the records: 1  

On the NP-Completeness of Some Graph Cluster Measures

  1. 1.
    SYSNO ASEP0405530
    Document TypeV - Research Report
    R&D Document TypeThe record was not marked in the RIV
    TitleOn the NP-Completeness of Some Graph Cluster Measures
    Author(s) Šíma, Jiří (UIVT-O) RID, SAI, ORCID
    Schaeffer, S.E. (FI)
    Issue dataCornell University, 2005
    SeriesarXiv.org e-Print archive
    Series numbercs.CC/0506100
    Number of pages9 s.
    Publication formWWW - WWW
    Languageeng - English
    CountryUS - United States
    Keywordsgraph clustering ; conductance ; density ; cluster editing ; NP-completeness
    Subject RIVBA - General Mathematics
    R&D Projects1M0545 GA MŠMT - Ministry of Education, Youth and Sports (MEYS)
    WorkplaceInstitute of Computer Science
    ContactTereza Šírová, sirova@cs.cas.cz, Tel.: 266 053 800
    Year of Publishing2006

Number of the records: 1  

  This site uses cookies to make them easier to browse. Learn more about how we use cookies.