Basket

  1. 1.
    0405530 - UIVT-O 330908 US eng V - Research Report
    Šíma, Jiří - Schaeffer, S.E.
    On the NP-Completeness of Some Graph Cluster Measures.
    Cornell University, 2005. 9 s. arXiv.org e-Print archive, cs.CC/0506100.
    R&D Projects: GA MŠMT 1M0545
    Keywords : graph clustering * conductance * density * cluster editing * NP-completeness
    Subject RIV: BA - General Mathematics
    http://arxiv.org/pdf/cs.CC/0506100
    Permanent Link: http://hdl.handle.net/11104/0125688
     
     

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