Počet záznamů: 1
On the NP-Completeness of Some Graph Cluster Measures
- 1.0405530 - UIVT-O 330908 US eng V - Výzkumná zpráva
Ší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.
Grant CEP: GA MŠMT 1M0545
Klíčová slova: graph clustering * conductance * density * cluster editing * NP-completeness
Kód oboru RIV: BA - Obecná matematika
http://arxiv.org/pdf/cs.CC/0506100
Citováno: 1
--- HINNE, M. - MARCHIORI, E. Cutting Graphs Using Competing Ant Colonies and an Edge Clustering Heuristic. EVOLUTIONARY COMPUTATION IN COMBINATORIAL OPTIMIZATION. ISSN 0302-9743, 2011, vol. 6622, p. 60-71. [WOS]
Trvalý link: http://hdl.handle.net/11104/0125688
Počet záznamů: 1