Search results

Records found: 2  
Your query: Keywords = "cluster editing"
    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
     
     
    2.
    0339971 - ÚI 2010 RIV DE eng C - Conference Paper (international conference)
    Šíma, Jiří - Schaeffer, S.E.
    On the NP-Completeness of Some Graph Cluster Measures.
    SOFSEM 2006: Theory and Practice of Computer Science. Berlin: Springer, 2006 - (Wiedermann, J.; Tel, G.; Pokorný, J.; Bieliková, M.; Štuller, J.), s. 530-537. Lecture Notes in Computer Science, 3831. ISBN 3-540-31198-X.
    [SOFSEM 2006. Conference on Current Trends in Theory and Practice of Computer Science /32./. Měřín (CZ), 21.01.2006-27.01.2006]
    R&D Projects: GA MŠMT(CZ) 1M0545
    Grant - others:Academy of Finland(FI) 126235
    Institutional research plan: CEZ:AV0Z10300504
    Keywords : graph clustering * conductance * density * cluster editing * NP-completeness
    Subject RIV: BA - General Mathematics
    Permanent Link: http://hdl.handle.net/11104/0183326
    FileDownloadSizeCommentaryVersionAccess
    0339971.pdf0323.7 KBAuthor´s preprintopen-access
     
     


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

Accept allSettingsReject all