Show simple item record

Graph Algorithms and Applications

dc.contributor.editorStefano, Gabriele Di
dc.contributor.editorCicerone, Serafino
dc.date.accessioned2022-05-06T11:28:06Z
dc.date.available2022-05-06T11:28:06Z
dc.date.issued2022
dc.identifierONIX_20220506_9783036515427_172
dc.identifier.urihttps://directory.doabooks.org/handle/20.500.12854/81106
dc.description.abstractThe 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.
dc.languageEnglish
dc.subject.classificationthema EDItEUR::K Economics, Finance, Business and Management::KN Industry and industrial studies::KNT Media, entertainment, information and communication industries::KNTX Information technology industriesen_US
dc.subject.classificationthema EDItEUR::U Computing and Information Technology::UY Computer scienceen_US
dc.subject.otherplanar graphs
dc.subject.otherk-planarity
dc.subject.otherNP-hardness
dc.subject.otherpolynomial time reduction
dc.subject.othercliques
dc.subject.otherpaths
dc.subject.othercomputational social choice
dc.subject.otherelection control
dc.subject.othermulti-winner election
dc.subject.othersocial influence
dc.subject.otherinfluence maximization
dc.subject.othercongestion games
dc.subject.otherpure Nash equilibrium
dc.subject.otherpotential games
dc.subject.otherprice of anarchy
dc.subject.otherprice of stability
dc.subject.otherphylogenetic tree
dc.subject.otherevolutionary tree
dc.subject.otherancestral mixture model
dc.subject.othermixture tree
dc.subject.othermixture distance
dc.subject.othertree comparison
dc.subject.otherclique independent set
dc.subject.otherclique transversal number
dc.subject.othersigned clique transversal function
dc.subject.otherminus clique transversal function
dc.subject.otherk-fold clique transversal set
dc.subject.otherdistance-hereditary graphs
dc.subject.otherstretch number
dc.subject.otherrecognition problem
dc.subject.otherforbidden subgraphs
dc.subject.otherhole detection
dc.subject.otheranalysis and design or graph algorithms
dc.subject.otherdistributed graph and network algorithms
dc.subject.othergraph theory with algorithmic applications
dc.subject.othercomputational complexity of graph problems
dc.subject.otherexperimental evaluation of graph algorithms
dc.titleGraph Algorithms and Applications
dc.typebook
oapen.identifier.doi10.3390/books978-3-0365-1541-0
oapen.relation.isPublishedBy46cabcaa-dd94-4bfe-87b4-55023c1b36d0
oapen.relation.isbn9783036515427
oapen.relation.isbn9783036515410
oapen.pages106
oapen.place.publicationBasel


Files in this item

FilesSizeFormatView

There are no files associated with this item.

This item appears in the following Collection(s)

Show simple item record

https://creativecommons.org/licenses/by/4.0/
Except where otherwise noted, this item's license is described as https://creativecommons.org/licenses/by/4.0/