LEADER 01520nam0-2200505-i-450-
001 990009787590403321
005 20131108124609.0
010   $a978-0-8218-9038-7$bpaperback
035   $a000978759
035   $aFED01000978759
035   $a(Aleph)000978759FED01
035   $a000978759
100   $a20131108d2013----km-y0itay50------ba
101 0 $aeng
102   $aUS
105   $aa---a---101yy
200 1 $aGraph partitioning and graph clustering$e10th DIMACS implementation challenge workshop, February 13-14, 2012, Georgia Institute of Technology, Atlanta, GA$fDavid A. Bader, Henning Meyerhenke, Peter Sanders, Dorothea Wagner, editors
210   $aProvidence$cAmerican Mathematical Society$d2013
215   $aXIII, 240 p.$d26 cm
225 1 $aContemporary mathematics$v588
610 0 $aAlgoritmi sui grafi
610 0 $aAlgoritmi nonnumerici
610 0 $aAlgoritmi paralleli
610 0 $aTeoria dei grafi
610 0 $aGrafi e matrici
610 0 $aIpergrafi
676   $a511'.5
702  1$aBader,$bDavid A.
702  1$aMeyerhenke,$bHenning
702  1$aSanders,$bPeter
702  1$aWagner,$bDorothea
801  0$aIT$bUNINA$gREICAT$2UNIMARC
901   $aBK
912   $a990009787590403321
952   $aC-1-(588$b104$fMA1
959   $aMA1
962   $a05C85
962   $a68W05
962   $a05C82
962   $a68W10
962   $a68R10
962   $a05C50
962   $a05C65
996   $aGraph partitioning and graph clustering$9833096
997   $aUNINA