%0 Journal Article
%T Special Issue on Graph Algorithms
%A Jesper Jansson
%J Algorithms
%D 2013
%I MDPI AG
%R 10.3390/a6030457
%X 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.
%K graph algorithms
%K computational complexity
%K fixed-parameter tractability
%K exact algorithms
%K approximation algorithms
%K heuristics
%K computational studies
%U http://www.mdpi.com/1999-4893/6/3/457