Number of the records: 1  

On the NP-Completeness of Some Graph Cluster Measures

  1. 1.
    SYSNO0405530
    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
    Edition arXiv.org e-Print archive , cs.CC/0506100
    Document TypeVýzkumná zpráva
    Grant 1M0545 GA MŠMT - Ministry of Education, Youth and Sports (MEYS)
    Languageeng
    CountryUS
    Keywords graph clustering * conductance * density * cluster editing * NP-completeness
    URL http://arxiv.org/pdf/cs.CC/0506100
    Permanent Linkhttp://hdl.handle.net/11104/0125688
     

Number of the records: 1  

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