Bild från Syndetics
Graph Algorithms
Materialtyp:
ArtikelUtgivningsinformation: MDPI - Multidisciplinary Digital Publishing Institute 2025Beskrivning: 1 electronic resource (182 p.)Innehållstyp: - text
- computer
- online resource
- 9783725845095
- 9783725845101
- Economics, Finance, Business and Management
- Industry & industrial studies
- Media, entertainment, information and communication industries
- Information technology industries
- approximation algorithms
- computational complexity
- computational studies
- exact algorithms
- fixed-parameter tractability
- graph algorithms
- heuristics
Inga fysiska exemplar för denna post
Open Access Unrestricted online access star
This is a Reprint of one of the first Special Issues of Algorithms ever published. It focuses on the theoretical and practical performance of algorithms for solving computational problems involving graphs. Several highly cited articles are included, which investigate topics such as the maximum clique problem, the Dubins traveling salesman problem, and computing the eccentricity distribution of a graph.
Creative Commons Licence cc by cc https://creativecommons.org/licenses/by/4.0/
eng
Freely available e-book