01230nam a2200301 i 4500991000113219707536090309s2008 enka b 001 0 eng d9780521878647b13815763-39ule_instDip.to Matematicaeng511.522AMS 05-02LC QA166.243.N34Nagamochi, Hiroshi629787Algorithmic aspects of graph connectivity /Hiroshi Nagamochi, Toshihide IbarakiCambridge ;New York :Cambridge University Press,2008xv, 375 p. :ill. ;25 cmEncyclopedia of mathematics and its applications ;123Includes bibliographical references (p. 357-369) and indexGraph connectivityGraph algorithmsIbaraki, Toshihideauthorhttp://id.loc.gov/vocabulary/relators/aut739595.b1381576328-01-1409-03-09991000113219707536LE013 05-XX NAG11 (2008)12013000209852le013pE60.25-l- 03130.i1494074709-03-09Algorithmic aspects of graph connectivity1465120UNISALENTOle01309-03-09ma -engenk0000752nam0-2200277 --450 991087149900332120240718103605.0978-88-15-12681-820240718d2008----kmuy0itay5050 baitaIT 001yyContro l'aldilĂ per una nuova cultura laicaFranco CrespiBolognaIl mulino2008124 p.22 cm.Saggi698Laicismo211.620Crespi,Franco<1930-2022>1354773ITUNINAREICATUNIMARCBK9910871499003321DAM B10 CREF 012024/6975FLFBCFLFBCContro l'aldilĂ 4175775UNINA