Number of the records: 1
On the NP-Completeness of Some Graph Cluster Measures
SYS 0405530 LBL 00000nam^^22^^^^^^^^450 005 20240103181900.9 101 0-
$a eng $d eng 102 $a US 200 1-
$a On the NP-Completeness of Some Graph Cluster Measures 210 $c Cornell University $d 2005 215 $a 9 s. $c WWW 225 1-
$a arXiv.org e-Print archive $v cs.CC/0506100 610 1-
$a graph clustering 610 1-
$a conductance 610 1-
$a density 610 1-
$a cluster editing 610 1-
$a NP-completeness 700 -1
$3 cav_un_auth*0100836 $a Šíma $b Jiří $p UIVT-O $w Department of Theoretical Computer Science $4 070 $T Ústav informatiky AV ČR, v. v. i. 701 -1
$3 cav_un_auth*0209067 $a Schaeffer $b S.E. $y FI $4 070 856 4-
$u http://arxiv.org/pdf/cs.CC/0506100
Number of the records: 1