Special Issue on Graph Algorithms

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.

Bibliographic Details
Main Author: Jesper Jansson
Format: Article
Language:English
Published: MDPI AG 2013-08-01
Series:Algorithms
Subjects:
graph algorithms
computational complexity
fixed-parameter tractability
exact algorithms
approximation algorithms
heuristics
computational studies
Online Access:http://www.mdpi.com/1999-4893/6/3/457
Description
Summary: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.
ISSN:1999-4893

Similar Items