LEADER 01230nam a2200301 i 4500
001 991000113219707536
008 090309s2008    enka     b    001 0 eng d
020   $a9780521878647
035   $ab13815763-39ule_inst
040   $aDip.to Matematica$beng
082 00$a511.5$222
084   $aAMS 05-02
084   $aLC QA166.243.N34
100 1 $aNagamochi, Hiroshi$0629787
245 10$aAlgorithmic aspects of graph connectivity /$cHiroshi Nagamochi, Toshihide Ibaraki
260   $aCambridge ;$aNew York :$bCambridge University Press,$c2008
300   $axv, 375 p. :$bill. ;$c25 cm
440  0$aEncyclopedia of mathematics and its applications ;$v123
504   $aIncludes bibliographical references (p. 357-369) and index
650  0$aGraph connectivity
650  0$aGraph algorithms
700 1 $aIbaraki, Toshihide$eauthor$4http://id.loc.gov/vocabulary/relators/aut$0739595
907   $a.b13815763$b28-01-14$c09-03-09
912   $a991000113219707536
945   $aLE013 05-XX NAG11 (2008)$g1$i2013000209852$lle013$op$pE60.25$q-$rl$s-  $t0$u3$v1$w3$x0$y.i14940747$z09-03-09
996   $aAlgorithmic aspects of graph connectivity$91465120
997   $aUNISALENTO
998   $ale013$b09-03-09$cm$da  $e-$feng$genk$h0$i0