Graph Algorithms

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

Descripció completa

Guardat en:
Dades bibliogràfiques
Format: Online
Idioma:anglès
Publicat: MDPI - Multidisciplinary Digital Publishing Institute 2025
Matèries:
Accés en línia:ONIX_20250812T110751_9783725845095_520
Etiquetes: Afegir etiqueta
Sense etiquetes, Sigues el primer a etiquetar aquest registre!
_version_ 1869517449300279296
collection Directory of Open Access Books
description 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.
format Online
id doab-20.500.12854ir-165765
institution Directory of Open Access Books
language eng
publishDate 2025
publishDateRange 2025
publishDateSort 2025
publisher MDPI - Multidisciplinary Digital Publishing Institute
publisherStr MDPI - Multidisciplinary Digital Publishing Institute
record_format ojs
spelling doab-20.500.12854ir-1657652025-08-12T10:14:52Z Graph Algorithms Jansson, Jesper graph algorithms computational complexity fixed-parameter tractability exact algorithms approximation algorithms heuristics computational studies thema EDItEUR::K Economics, Finance, Business and Management::KN Industry and industrial studies::KNT Media, entertainment, information and communication industries::KNTX Information technology industries 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. 2025-08-12T10:14:49Z 2025-08-12T10:14:49Z 2025 book ONIX_20250812T110751_9783725845095_520 9783725845095 9783725845101 https://directory.doabooks.org/handle/20.500.12854/165765 eng image/jpeg Attribution 4.0 International https://mdpi.com/books https://mdpi.com/books/pdfview/book/11255 MDPI - Multidisciplinary Digital Publishing Institute 10.3390/books978-3-7258-4510-1 10.3390/books978-3-7258-4510-1 46cabcaa-dd94-4bfe-87b4-55023c1b36d0 9783725845095 9783725845101 182 open access
spellingShingle graph algorithms
computational complexity
fixed-parameter tractability
exact algorithms
approximation algorithms
heuristics
computational studies
thema EDItEUR::K Economics, Finance, Business and Management::KN Industry and industrial studies::KNT Media, entertainment, information and communication industries::KNTX Information technology industries
Graph Algorithms
title Graph Algorithms
title_full Graph Algorithms
title_fullStr Graph Algorithms
title_full_unstemmed Graph Algorithms
title_short Graph Algorithms
title_sort graph algorithms
topic graph algorithms
computational complexity
fixed-parameter tractability
exact algorithms
approximation algorithms
heuristics
computational studies
thema EDItEUR::K Economics, Finance, Business and Management::KN Industry and industrial studies::KNT Media, entertainment, information and communication industries::KNTX Information technology industries
topic_facet graph algorithms
computational complexity
fixed-parameter tractability
exact algorithms
approximation algorithms
heuristics
computational studies
thema EDItEUR::K Economics, Finance, Business and Management::KN Industry and industrial studies::KNT Media, entertainment, information and communication industries::KNTX Information technology industries
url ONIX_20250812T110751_9783725845095_520