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...
Պահպանված է:
| Ձևաչափ: | Online |
|---|---|
| Լեզու: | անգլերեն |
| Հրապարակվել է: |
MDPI - Multidisciplinary Digital Publishing Institute
2022
|
| Խորագրեր: | |
| Առցանց հասանելիություն: | ONIX_20220506_9783036515427_172 |
| Ցուցիչներ: |
Չկան պիտակներ, Եղեք առաջինը, ով նշում է այս գրառումը!
|
| _version_ | 1869519573228716032 |
|---|---|
| collection | Directory of Open Access Books |
| description | 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. |
| format | Online |
| id | doab-20.500.12854ir-81106 |
| institution | Directory of Open Access Books |
| language | eng |
| publishDate | 2022 |
| publishDateRange | 2022 |
| publishDateSort | 2022 |
| publisher | MDPI - Multidisciplinary Digital Publishing Institute |
| publisherStr | MDPI - Multidisciplinary Digital Publishing Institute |
| record_format | ojs |
| spelling | doab-20.500.12854ir-811062024-03-30T12:51:23Z Graph Algorithms and Applications Stefano, Gabriele Di Cicerone, Serafino planar graphs k-planarity NP-hardness polynomial time reduction cliques paths computational social choice election control multi-winner election social influence influence maximization congestion games pure Nash equilibrium potential games price of anarchy price of stability phylogenetic tree evolutionary tree ancestral mixture model mixture tree mixture distance tree comparison clique independent set clique transversal number signed clique transversal function minus clique transversal function k-fold clique transversal set distance-hereditary graphs stretch number recognition problem forbidden subgraphs hole detection analysis and design or graph algorithms distributed graph and network algorithms graph theory with algorithmic applications computational complexity of graph problems experimental evaluation of graph algorithms thema EDItEUR::K Economics, Finance, Business and Management::KN Industry and industrial studies::KNT Media, entertainment, information and communication industries::KNTX Information technology industries thema EDItEUR::U Computing and Information Technology::UY Computer science 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. 2022-05-06T11:28:06Z 2022-05-06T11:28:06Z 2022 book ONIX_20220506_9783036515427_172 9783036515427 9783036515410 https://directory.doabooks.org/handle/20.500.12854/81106 eng image/jpeg Attribution 4.0 International https://mdpi.com/books/pdfview/book/5135 https://mdpi.com/books/pdfview/book/5135 MDPI - Multidisciplinary Digital Publishing Institute 10.3390/books978-3-0365-1541-0 10.3390/books978-3-0365-1541-0 46cabcaa-dd94-4bfe-87b4-55023c1b36d0 9783036515427 9783036515410 106 Basel open access |
| spellingShingle | planar graphs k-planarity NP-hardness polynomial time reduction cliques paths computational social choice election control multi-winner election social influence influence maximization congestion games pure Nash equilibrium potential games price of anarchy price of stability phylogenetic tree evolutionary tree ancestral mixture model mixture tree mixture distance tree comparison clique independent set clique transversal number signed clique transversal function minus clique transversal function k-fold clique transversal set distance-hereditary graphs stretch number recognition problem forbidden subgraphs hole detection analysis and design or graph algorithms distributed graph and network algorithms graph theory with algorithmic applications computational complexity of graph problems experimental evaluation of graph algorithms thema EDItEUR::K Economics, Finance, Business and Management::KN Industry and industrial studies::KNT Media, entertainment, information and communication industries::KNTX Information technology industries thema EDItEUR::U Computing and Information Technology::UY Computer science Graph Algorithms and Applications |
| title | Graph Algorithms and Applications |
| title_full | Graph Algorithms and Applications |
| title_fullStr | Graph Algorithms and Applications |
| title_full_unstemmed | Graph Algorithms and Applications |
| title_short | Graph Algorithms and Applications |
| title_sort | graph algorithms and applications |
| topic | planar graphs k-planarity NP-hardness polynomial time reduction cliques paths computational social choice election control multi-winner election social influence influence maximization congestion games pure Nash equilibrium potential games price of anarchy price of stability phylogenetic tree evolutionary tree ancestral mixture model mixture tree mixture distance tree comparison clique independent set clique transversal number signed clique transversal function minus clique transversal function k-fold clique transversal set distance-hereditary graphs stretch number recognition problem forbidden subgraphs hole detection analysis and design or graph algorithms distributed graph and network algorithms graph theory with algorithmic applications computational complexity of graph problems experimental evaluation of graph algorithms thema EDItEUR::K Economics, Finance, Business and Management::KN Industry and industrial studies::KNT Media, entertainment, information and communication industries::KNTX Information technology industries thema EDItEUR::U Computing and Information Technology::UY Computer science |
| topic_facet | planar graphs k-planarity NP-hardness polynomial time reduction cliques paths computational social choice election control multi-winner election social influence influence maximization congestion games pure Nash equilibrium potential games price of anarchy price of stability phylogenetic tree evolutionary tree ancestral mixture model mixture tree mixture distance tree comparison clique independent set clique transversal number signed clique transversal function minus clique transversal function k-fold clique transversal set distance-hereditary graphs stretch number recognition problem forbidden subgraphs hole detection analysis and design or graph algorithms distributed graph and network algorithms graph theory with algorithmic applications computational complexity of graph problems experimental evaluation of graph algorithms thema EDItEUR::K Economics, Finance, Business and Management::KN Industry and industrial studies::KNT Media, entertainment, information and communication industries::KNTX Information technology industries thema EDItEUR::U Computing and Information Technology::UY Computer science |
| url | ONIX_20220506_9783036515427_172 |