00914nam a22002533i 450099100322668970753620040203121924.0040802s1981 it a||||||||||||||||ita b13043584-39ule_instARCHE-099619ExLBiblioteca Interfacoltà itaA.t.i. Arché s.c.r.l. Pandora Sicilia s.r.l.709.45Francese, Franco488654Elide /Franco Francese ; con un inedito di Vittorio SereniMilano :Scheiwiller,1981[50] c. :ill. ;16x16 cmIl quadratoSereni, Vittorio.b1304358402-04-1405-08-04991003226689707536LE002 Ar. V G 1512002000261489le002C. 1-E0.00-l- 00000.i1366729405-08-04Elide287015UNISALENTOle00205-08-04ma -itait 0103396nam 2200829z- 450 991056645700332120220506(CKB)5680000000037811(oapen)https://directory.doabooks.org/handle/20.500.12854/81106(oapen)doab81106(EXLCZ)99568000000003781120202205d2022 |y 0engurmn|---annantxtrdacontentcrdamediacrrdacarrierGraph Algorithms and ApplicationsBaselMDPI - Multidisciplinary Digital Publishing Institute20221 online resource (106 p.)3-0365-1542-9 3-0365-1541-0 The 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.Computer sciencebicsscInformation technology industriesbicsscanalysis and design or graph algorithmsancestral mixture modelclique independent setclique transversal numbercliquescomputational complexity of graph problemscomputational social choicecongestion gamesdistance-hereditary graphsdistributed graph and network algorithmselection controlevolutionary treeexperimental evaluation of graph algorithmsforbidden subgraphsgraph theory with algorithmic applicationshole detectioninfluence maximizationk-fold clique transversal setk-planarityminus clique transversal functionmixture distancemixture treemulti-winner electionNP-hardnesspathsphylogenetic treeplanar graphspolynomial time reductionpotential gamesprice of anarchyprice of stabilitypure Nash equilibriumrecognition problemsigned clique transversal functionsocial influencestretch numbertree comparisonComputer scienceInformation technology industriesStefano Gabriele Diedt1280432Cicerone SerafinoedtStefano Gabriele DiothCicerone SerafinoothBOOK9910566457003321Graph Algorithms and Applications3016943UNINA