Editorial: Special issue on graph algorithms (Q1736576)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Editorial: Special issue on graph algorithms |
scientific article; zbMATH DE number 7042171
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Editorial: Special issue on graph algorithms |
scientific article; zbMATH DE number 7042171 |
Statements
Editorial: Special issue on graph algorithms (English)
0 references
26 March 2019
0 references
Summary: This special issue of \textit{Algorithms} is devoted to the design and analysis of algorithms for solving combinatorial problems of a theoretical or practical nature involving graphs, with a focus on computational complexity.
0 references
graph algorithms
0 references
computational complexity
0 references
fixed-parameter tractability
0 references
exact algorithms
0 references
approximation algorithms
0 references
heuristics
0 references
computational studies
0 references
0.7889154553413391
0 references
0.7833513617515564
0 references
0.748457670211792
0 references
