LEADER 00955nam a22002291i 4500 001 991002913529707536 005 20030817170248.0 008 030925s1896 it |||||||||||||||||ita 035 $ab12354296-39ule_inst 035 $aARCHE-040183$9ExL 040 $aBiblioteca Interfacoltà$bita$cA.t.i. Arché s.c.r.l. Pandora Sicilia s.r.l. 100 1 $aAlbini, Decio$0438360 245 13$aLa Questione degli Esposti e il Brefotrofio di Roma /$cDecio Albini 260 $aRoma :$bTip. della Casa Editrice Italiana,$c1896 300 $a127 p. ;$c26 cm 650 4$aRoma$xBrefotrofi$xLegislazione 907 $a.b12354296$b02-04-14$c08-10-03 912 $a991002913529707536 945 $aLE002 Busta B 96/11 (Fondo Codacci-Pisanelli)$g1$i2002000104595$lle002$o-$pE0.00$q-$rn$so $t0$u0$v0$w0$x0$y.i12758462$z08-10-03 996 $aQuestione degli Esposti e il Brefotrofio di Roma$9158107 997 $aUNISALENTO 998 $ale002$b08-10-03$cm$da $e-$fita$git $h3$i1 LEADER 03396nam 2200829z- 450 001 9910566457003321 005 20220506 035 $a(CKB)5680000000037811 035 $a(oapen)https://directory.doabooks.org/handle/20.500.12854/81106 035 $a(oapen)doab81106 035 $a(EXLCZ)995680000000037811 100 $a20202205d2022 |y 0 101 0 $aeng 135 $aurmn|---annan 181 $ctxt$2rdacontent 182 $cc$2rdamedia 183 $acr$2rdacarrier 200 00$aGraph Algorithms and Applications 210 $aBasel$cMDPI - Multidisciplinary Digital Publishing Institute$d2022 215 $a1 online resource (106 p.) 311 08$a3-0365-1542-9 311 08$a3-0365-1541-0 330 $aThe mixture of data in real-life exhibits structure or connection property in nature. Typical data include biological data, communication network data, image data, etc. Graphs provide a natural way to represent and analyze these types of data and their relationships. Unfortunately, the related algorithms usually suffer from high computational complexity, since some of these problems are NP-hard. Therefore, in recent years, many graph models and optimization algorithms have been proposed to achieve a better balance between efficacy and efficiency. This book contains some papers reporting recent achievements regarding graph models, algorithms, and applications to problems in the real world, with some focus on optimization and computational complexity. 606 $aComputer science$2bicssc 606 $aInformation technology industries$2bicssc 610 $aanalysis and design or graph algorithms 610 $aancestral mixture model 610 $aclique independent set 610 $aclique transversal number 610 $acliques 610 $acomputational complexity of graph problems 610 $acomputational social choice 610 $acongestion games 610 $adistance-hereditary graphs 610 $adistributed graph and network algorithms 610 $aelection control 610 $aevolutionary tree 610 $aexperimental evaluation of graph algorithms 610 $aforbidden subgraphs 610 $agraph theory with algorithmic applications 610 $ahole detection 610 $ainfluence maximization 610 $ak-fold clique transversal set 610 $ak-planarity 610 $aminus clique transversal function 610 $amixture distance 610 $amixture tree 610 $amulti-winner election 610 $aNP-hardness 610 $apaths 610 $aphylogenetic tree 610 $aplanar graphs 610 $apolynomial time reduction 610 $apotential games 610 $aprice of anarchy 610 $aprice of stability 610 $apure Nash equilibrium 610 $arecognition problem 610 $asigned clique transversal function 610 $asocial influence 610 $astretch number 610 $atree comparison 615 7$aComputer science 615 7$aInformation technology industries 700 $aStefano$b Gabriele Di$4edt$01280432 702 $aCicerone$b Serafino$4edt 702 $aStefano$b Gabriele Di$4oth 702 $aCicerone$b Serafino$4oth 906 $aBOOK 912 $a9910566457003321 996 $aGraph Algorithms and Applications$93016943 997 $aUNINA