TY - BOOK ID - 133365475 TI - Graph Algorithms and Applications AU - Stefano, Gabriele Di AU - Cicerone, Serafino PY - 2022 PB - Basel MDPI - Multidisciplinary Digital Publishing Institute DB - UniCat KW - Information technology industries KW - Computer science KW - planar graphs KW - k-planarity KW - NP-hardness KW - polynomial time reduction KW - cliques KW - paths KW - computational social choice KW - election control KW - multi-winner election KW - social influence KW - influence maximization KW - congestion games KW - pure Nash equilibrium KW - potential games KW - price of anarchy KW - price of stability KW - phylogenetic tree KW - evolutionary tree KW - ancestral mixture model KW - mixture tree KW - mixture distance KW - tree comparison KW - clique independent set KW - clique transversal number KW - signed clique transversal function KW - minus clique transversal function KW - k-fold clique transversal set KW - distance-hereditary graphs KW - stretch number KW - recognition problem KW - forbidden subgraphs KW - hole detection KW - analysis and design or graph algorithms KW - distributed graph and network algorithms KW - graph theory with algorithmic applications KW - computational complexity of graph problems KW - experimental evaluation of graph algorithms UR - https://www.unicat.be/uniCat?func=search&query=sysid:133365475 AB - 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. ER -