Special Issue on Graph Algorithms
This special issue of 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.
| Main Author: | |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
MDPI AG
2013-08-01
|
| Series: | Algorithms |
| Subjects: | |
| Online Access: | http://www.mdpi.com/1999-4893/6/3/457 |
| id |
doaj-d53efd4860064ab68d773aed4bc6552c |
|---|---|
| record_format |
Article |
| spelling |
doaj-d53efd4860064ab68d773aed4bc6552c2020-11-25T00:54:30ZengMDPI AGAlgorithms1999-48932013-08-016345745810.3390/a6030457Special Issue on Graph AlgorithmsJesper JanssonThis special issue of 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.http://www.mdpi.com/1999-4893/6/3/457graph algorithmscomputational complexityfixed-parameter tractabilityexact algorithmsapproximation algorithmsheuristicscomputational studies |
| collection |
DOAJ |
| language |
English |
| format |
Article |
| sources |
DOAJ |
| author |
Jesper Jansson |
| spellingShingle |
Jesper Jansson Special Issue on Graph Algorithms Algorithms graph algorithms computational complexity fixed-parameter tractability exact algorithms approximation algorithms heuristics computational studies |
| author_facet |
Jesper Jansson |
| author_sort |
Jesper Jansson |
| title |
Special Issue on Graph Algorithms |
| title_short |
Special Issue on Graph Algorithms |
| title_full |
Special Issue on Graph Algorithms |
| title_fullStr |
Special Issue on Graph Algorithms |
| title_full_unstemmed |
Special Issue on Graph Algorithms |
| title_sort |
special issue on graph algorithms |
| publisher |
MDPI AG |
| series |
Algorithms |
| issn |
1999-4893 |
| publishDate |
2013-08-01 |
| description |
This special issue of 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. |
| topic |
graph algorithms computational complexity fixed-parameter tractability exact algorithms approximation algorithms heuristics computational studies |
| url |
http://www.mdpi.com/1999-4893/6/3/457 |
| work_keys_str_mv |
AT jesperjansson specialissueongraphalgorithms |
| _version_ |
1725234029544865792 |