Graph Algorithms and Applications

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 algor...

Celý popis

Uložené v:
Podrobná bibliografia
Médium: E-kniha
Jazyk:English
Vydavateľské údaje: Basel MDPI - Multidisciplinary Digital Publishing Institute 2022
Predmet:
analysis and design or graph algorithms
ancestral mixture model
clique independent set
clique transversal number
cliques
computational complexity of graph problems
computational social choice
Computer science
Computing and Information Technology
congestion games
distance-hereditary graphs
distributed graph and network algorithms
Economics, Finance, Business and Management
election control
evolutionary tree
experimental evaluation of graph algorithms
forbidden subgraphs
graph theory with algorithmic applications
hole detection
Industry and industrial studies
influence maximization
Information technology industries
k-fold clique transversal set
k-planarity
Media, entertainment, information and communication industries
minus clique transversal function
mixture distance
mixture tree
multi-winner election
NP-hardness
paths
phylogenetic tree
planar graphs
polynomial time reduction
potential games
price of anarchy
price of stability
pure Nash equilibrium
recognition problem
signed clique transversal function
social influence
stretch number
tree comparison
ISBN:9783036515410, 3036515410, 3036515429, 9783036515427
On-line prístup:Získať plný text
Tagy: Pridať tag
Žiadne tagy, Buďte prvý, kto otaguje tento záznam!
Popis
Shrnutí: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.
ISBN:9783036515410
3036515410
3036515429
9783036515427
DOI:10.3390/books978-3-0365-1541-0